解法1:BFS,有n个节点每个节点最多被访问一次,所以BFS时间复杂度为O(n)。注意ab的特判。
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int N 205;
int n, a, b;
int k[N], s[N];
b…
emulator: ERROR: x86_64 emulation currently requires hardware acceleration! Please ensure KVM is properly installed and usable. CPU acceleration status: KVM requires a CPU that supports vmx or svm
关闭虚拟机服务 PowerShell关闭HV bcdedit /set hypervisorl…