51nod 1422 沙拉酱前缀

http://www.51nod.com/onlineJudge/questionCode.html#problemId=1422&noticeId=399940

题意：

思路：

先把所有步骤存起来，对于每次查询，二分结果。

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 using namespace std;
 const int maxn = 1e5+;

 int op[maxn][];
 long long d[maxn];

 template <class T>
 inline void scan_d(T &ret)
 {
     char c;
     ret = ;
     while ((c = getchar()) < '' || c > '');
     while (c >= '' && c <= '')
     {
         ret = ret *  + (c - ''), c = getchar();
     }
 }

 int main()
 {
     //freopen("in.txt","r",stdin);
     int m;
     scan_d(m);
     d[] = ;
     for(int i=;i<=m;i++)
     {
         scan_d(op[i][]);
         if(op[i][]==)
         {
             scan_d(op[i][]);
             d[i] = d[i-]+;
         }
         else
         {
             scan_d(op[i][]);
             scan_d(op[i][]);
             d[i] = d[i-]+(long long)op[i][]*op[i][];
         }
     }
     int n;
     long long x;
     scan_d(n);
     while(n--)
     {
         scanf("%lld",&x);
         while(true)
         {
             int pos = lower_bound(d+,d+m+,x)-d;
             if(op[pos][]==)
             {
                 printf("%d ",op[pos][]);
                 break;
             }
             else x = (x-d[pos-]-)%op[pos][]+;
         }
     }
     printf("\n");
     return ;
 }