Shopping Gym

参考https://vjudge.net/solution/10900093

心得: 原来二分还能这样对与区间用

#include<bits/stdc++.h>#include<iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define sf scanf#define pf printf#define mem(a,b) memset(a,b,sizeof(a));#define rep(i,a,b) for(int i=(a);i<=(b);++i)#define MP make_pair#define ULL unsigned long long#define LL   long long#define inf 0x3f3f3f3f#define md ((ll+rr)>>1)#define ls (i<<1)#define rs (ls|1)#define eps 1e-5#define ree freopen("in.txt","r",stdin);#define bug pf("----------------");#define N 200050#define M 20020#define INF 1e9int  n,q;LL a[N];LL dp[N][30];int mm[N];void init(){    mm[0]=-1;    for(int i=1;i<=n;++i){        mm[i]=((i&(i-1))==0)?mm[i-1]+1:mm[i-1];        //上面那行原本是这样的          mm[i]=(i&(i-1)==0)?mm[i-1]+1:mm[i-1]; 找了很久的错        dp[i][0]=a[i];    }    for(int j=1;j<=mm[n];++j)        for(int i=1;i+(1<<j)-1<=n;++i)            dp[i][j]=min(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);}LL rmq(int x,int y){    int k=mm[y-x+1];    return min(dp[x][k],dp[y-(1<<k)+1][k]);}int main(){        //ree    sf("%d%d",&n,&q);    for(int i=1;i<=n;++i)sf("%lld",&a[i]);    init();    while(q--){        LL x;        int l,r;        sf("%lld%d%d",&x,&l,&r);        int now=l;        while(x&&now<=r){            int lb=now-1,ub=r;            while(ub>lb+1){                int mid=(lb+ub)>>1;                if(rmq(now,mid)<=x)ub=mid;                else lb=mid;            }            x%=a[ub];            now=ub+1;        }        pf("%lld\n",x);    }}