FZU1894 志愿者选拔

基础单调队列,维护某区间的最值问题的工具。

/*****************************************
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;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值