BestCoder Round #89 1002 Fxx and game

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <iostream>
 4 #include <algorithm>
 5 
 6 using namespace std;
 7 
 8 const int maxn = 1000000 + 5;
 9 int dis[maxn];
10 int d[maxn];
11 
12 #define inf 0x3f3f3f3f
13 
14 int main()
15 {
16     int t;
17     cin>>t;
18     while(t--) {
19         int x,k,t;
20         cin>>x>>k>>t;
21 
22         int l,r;
23 
24         l = r = 1;
25         dis[1] = 0;
26         d[1] = 1;
27 
28         for(int j=2;j<=x;j++) {
29             
30             dis[j] = inf;
31             
32             while(l<=r&&d[l]<j-t) l++;
33             if(l<=r) dis[j] = dis[d[l]] + 1;
34             if(j%k==0) dis[j] = min(dis[j],dis[j/k]+1);
35             while(l<=r&&dis[d[r]]>=dis[j]) r--;
36             d[++r] = j;
37 
38         }
39 
40         printf("%d\n",dis[x]);
41     }
42 
43     return 0;
44 }