FZU 1894 志愿者选拔

最新推荐文章于 2019-05-09 13:59:38 发布

little_胖

最新推荐文章于 2019-05-09 13:59:38 发布

阅读量479

点赞数

分类专栏：单调队列&&单调栈

本文链接：https://blog.csdn.net/wangjie_wang/article/details/9850637

版权

单调队列&&单调栈专栏收录该内容

8 篇文章 0 订阅

订阅专栏

是个简单的单调队列，不多说了。

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef __int64 int64;
typedef long long ll;
#define M 100005
#define N 1000005
#define max_inf 0x7f7f7f7f
#define min_inf 0x80808080
#define mod 1000000007

int q[N] , rp[N];

int main()
{
	int t , i;
	char op[10] , name[10];
	int front , rear;
	scanf("%d",&t);
	while (t--)
	{
		scanf("%s",op);
		int cnt = 0 , out = 0;
		front = rear = 0;
		while (scanf("%s",op) , strcmp(op,"END") != 0)
		{
			if (strcmp(op , "C") == 0)
			{
				scanf("%s%d",name,&rp[cnt]);
				cnt++;
				while (rear > front && rp[q[rear-1]] < rp[cnt-1])rear--;
				q[rear++] = cnt-1;
			}
			else if (strcmp(op , "Q") == 0)
			{
				while (q[front] < out)front++;
				if (front >= rear)
					printf("-1\n");
				else
					printf("%d\n",rp[q[front]]);
			}
			else
			{
				out++;
			}
		}
	}
	return 0;
}