P3572 [POI2014]PTA-Little Bird

https://www.luogu.org/problemnew/show/P3572 

总结：STL会tle。模拟单调队列；要注意进出队列顺序； 

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

int q[maxn];
int dp[maxn],a[maxn];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        a[i]=read();
    int m;
    //cin>>m;
    m=read();
    while(m--)
    {
        int k;
        //cin>>k;
        k=read();
        int head=1;
        int tail=0;
        q[++tail]=1;
        for(int i=2;i<=n;i++)
        {
            while(head<=tail&&q[head]<i-k) head++;
            if(a[q[head]]>a[i]) dp[i]=dp[q[head]];
            else dp[i]=dp[q[head]]+1;
            while(head<=tail&&(dp[q[tail]]>dp[i]||(dp[q[tail]]==dp[i]&&a[q[tail]]<=a[i]))) tail--;
            q[++tail]=i;
        }
        //cout<<dp[n]<<endl;
        printf("%d\n",dp[n]);
    }

    return 0;
}