#include "routers.h"
#define pb push_back
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
vector<int> ans;
ans.pb(0);
int curr[n+3];
for(int i = 0; i < n+3; ++i) curr[i] = -1;
for(int i = 1; i < n; ++i){
int L = max(ans.back(), curr[i-1])+1;
int R = l;
int idx = -1;
while(L <= R){
int mid = (L+R)/2;
int dist = use_detector(mid);
curr[dist] = max(curr[dist], mid);
if(dist > i-1){
R = mid-1;
} else{
idx = mid;
L = mid+1;
}
}
curr[i-1] = idx;
int z = idx+idx-ans.back();
ans.pb(z);
}
return ans;
}
