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+5;

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

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

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