过了4个,如何优化?
#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
const int N = 1000010;
int T, n, m, k, res;
int bfs(int k){
queue<int> q;
q.push(k);
int res = 0;
while(q.size()){
int temp = q.front();
q.pop();
res++;
int start = (temp - 1) * m + 2;
if(start > n) break;
for(int i = start; i < start + m;i++){
if(i > n) break;
q.push(i);
}
}
res += q.size();
return res;
}
int main()
{
scanf("%d", &T);
for(int i = 1;i <= T;i++){
int res = 0;
scanf("%d%d%d", &n, &m, &k);
res += bfs(k);
cout << res << endl;
}
return 0;
}