1342: [Baltic2007]Sound静音问题

 https://www.lydsy.com/JudgeOnline/problem.php?id=1342

思路：单调队列

#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 a[maxn];
deque<int>q1,q2;
int main()
{
    //FAST_IO;

    int n,m,c;
    cin>>n>>m>>c;
    for(int i=1;i<=n;i++)cin>>a[i];

    int ans=0,Max=0,Min=0;
    for(int i=1;i<=n;i++)
    {
        while(!q1.empty()&&a[q1.back()]>a[i]) q1.pop_back();
        q1.push_back(i);
        if(i>=m)
        {
            while(!q1.empty()&&q1.front()<=i-m) q1.pop_front();
            Min=q1.front();
        }

        while(!q2.empty()&&a[q2.back()]<a[i]) q2.pop_back();
        q2.push_back(i);
        if(i>=m)
        {
            while(!q2.empty()&&q2.front()<=i-m) q2.pop_front();
            Max=q2.front();
        }
        if(i>=m)
        {
            if(a[Max]-a[Min]<=c)
            {
                ans++;
                cout<<i-m+1<<endl;
            }
        }

    }

    if(ans==0) puts("NONE");

    return 0;
}