Editor Page50 对顶栈

Editor Page50 对顶栈

活了一辈子好像没用过栈的size函数…就当现在学到了吧

PS：由于插入的整数可以为负数，所以一定要将$f[0]$初始化为-INF

代码：

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
stack<int> q1,q2;
int f[maxn],pos,t,x,sum[maxn],n;
char s[maxn];
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        while(!q1.empty())q1.pop();
        while(!q2.empty())q2.pop();
        f[0]=-INF;
        while(n--)
        {
            scanf("%s",s);
            if (s[0]=='I')
            {
                scanf("%d",&x);
                q1.push(x);
                sum[q1.size()]=sum[q1.size()-1]+x;
                f[q1.size()]=max(f[q1.size()-1],sum[q1.size()]);
            }
            else if (s[0]=='D'&&!q1.empty())q1.pop();
            else if (s[0]=='L'&&!q1.empty())
            {
                q2.push(q1.top());
                q1.pop();
            }
            else if (s[0]=='R')
            {
                if (!q2.empty())
                {
                    int x=q2.top();
                    q1.push(x);
                    q2.pop();
                    sum[q1.size()]=sum[q1.size()-1]+x;
                    f[q1.size()]=max(f[q1.size()-1],sum[q1.size()]);
                }
            }
            else if (s[0]=='Q')
            {
                scanf("%d",&x);
                W(f[x]);
            }
        }
    }
    return 0;
}