bzoj 1012 maxnumber 树状数组

题意：插入某值，查询区间最大

解：考虑树状数组维护区间最值
在add里面 我们改原来的  

 

for(;x<maxn-1;x+=lowbit(x)) c[x]+=val ;------>c[x]=max(c[x],val);

在ask里面我们要了小修改：

 

ll ask (int x, int y) {
	ll ret = 0, len = y-x+1;
	while (len && y) {
		if (len < lowbit(y)) {///   这里的lowbit  定义外面一定要有括号
			ret = max (ret, a[y]);
			y--; len--;
		} else {
			ret = max (ret, c[y]);
			len -= lowbit(y);
			y -= lowbit(y);
		}
	}
	return ret;
}

#include<bits/stdc++.h>
using namespace std;
#define en '\n'
#define ll long long
ll mo;
const ll maxn =6e5+10;
const ll  inf = 1e8;
ll n,m,d;
#define lowbit(x) (x&(-x))
ll c[maxn];
ll a[maxn];
ll pos;
void add (ll x, ll val) {
	for (;x<= maxn-2;x+=lowbit(x)) {
		c[x] = max (c[x], val);
	}
}
ll ask (int x, int y) {
	ll ret = 0, len = y-x+1;
	while (len && y) {
		if (len < lowbit(y)) {
			ret = max (ret, a[y]);
			y--; len--;
		} else {
			ret = max (ret, c[y]);
			len -= lowbit(y);
			y -= lowbit(y);
		}
	}
	return ret;
}

char s[20];
signed main()
{
#ifdef local
freopen("input2.txt","r",stdin);
#endif // local
    scanf("%lld%lld",&m,&mo);
    ll las=0;
     pos=0;
    while(m--){
        ll x;
    scanf("%s%lld",s,&x);
        if(s[0]=='A'){
            a[++pos]=(x+las)%mo;
            add(pos,a[pos]);
        }else{
            las=(ask(pos-x+1,pos));
            cout<<las<<en;
        }
    }
    return 0;
}