luogu P1198 [JSOI2008]最大数

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
#define maxn 200010

int dp[maxn][21],cnt,b[maxn];

void add(int x){
  dp[++ cnt][0] = x;
  for(int i = 1;cnt - (1 << i) >= 0;i++)
    dp[cnt][i] = max(dp[cnt][i - 1],dp[cnt - (1 << (i - 1))][i - 1]);
}

int query(int x){
  int k = log2(cnt - x + 1);
  return max(dp[cnt][k],dp[x - 1 + (1 << k)][k]);
}

int main(){
  int m,mod,last = 0;
  scanf("%d%d",&m,&mod);
  for(int i = 1;i <= m;i++){
    char ch;
    cin >> ch;
    if(ch == ‘A‘){
      int x;
      scanf("%d",&x);
      int qwq = (x + last) % mod; 
      add(qwq);
    }
    else{
      int y;
      scanf("%d",&y);
      int ans = query(cnt - y + 1);
      last = ans;
      printf("%d\n",ans);
    }
  }
  return 0;
}