FZU 1894 志愿者选拔 单调队列

#include <cstdio>
#define sf scanf
#define pf printf

using namespace std;
const int maxn = 1000000 + 5;
int q[maxn],v[maxn];
int qf,qt;
char op[10];
int main(){
int T;sf("%d",&T);
while( T-- ){
sf("%s",op);
int L = 0,R = 0;
qf = qt = 0;
while(sf("%s",op) && op[0] != 'E'){
if(op[0] == 'C'){
sf("%s",op);sf("%d",&v[R++]);
while(qf != qt && v[q[qt - 1]] <= v[R - 1]) qt--;
q[qt++] = R - 1;
}
else if(op[0] == 'Q'){
if(L == R) pf("-1\n");
else pf("%d\n",v[q[qf]]);
}
else{
L++;
while(qf != qt && q[qf] < L) qf++;
}
}
}
}