【bzoj1012】[JSOI2008]最大数maxnumber

Language:C++

Result:Accepted

Time:452ms

Memory:2836kb

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<ctime>

using

namespace

std;

#defineMAXN200010

int

a[MAXN],mm[MAXN];

char

q[1];

int

m,d;

int

t,l,p;

int

main()

{

scanf

(

"%d%d"

,&m,&d);

while

(m--)

{

scanf

(

"%s%d"

,q,&p);

if

(q[0]==

'A'

)

{

a[++t]=(l+p)%d;

for

(

int

i=t;i;i--)

if

(mm[i]<a[t])

mm[i]=a[t];

else

break

;

}

else

printf

(

"%d\n"

,l=mm[t-p+1]);

}

return

0;

}