基础单调队列,维护某区间的最值问题的工具。
/*****************************************
Author :Crazy_AC(JamesQi)
Time :2016
File Name :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;
#define MEM(x,y) memset(x, y,sizeof x)
#define pk push_back
#define lson rt << 1
#define rson rt << 1 | 1
#define bug cout << "BUG HERE\n"
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
const double eps = 1e-10;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int nCase = 0;
const int maxn = 1000000 + 10;
char s[20], op[20];
LL val;
LL que[maxn], score[maxn];
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int T;
scanf("%d",&T);
while(T--)
{
scanf("%s",s);
int l, r, x, y;
l = r = x = y = 0;
while(true)
{
scanf("%s",s);
if (s[0] == 'C')
{
scanf("%s",op);
scanf("%lld", &val);
while(x < y)
{
if (score[y - 1] < val) y--;
else break;
}
score[y++] = val;
que[r++] = val;
}
else if (s[0] == 'G')
{
if (x == y)
{
printf("-1\n");
continue;
}
else
{
val = que[l++];
if (score[x] == val) x++;
}
}
else if (s[0] == 'Q')
{
if (x == y)
{
printf("-1\n");
continue;
}
printf("%lld\n", score[x]);
}
else if (s[0] == 'E') break;
}
}
return 0;
}