bzoj2096 pilots

 

依旧是维护两个单调队列，只是队首检查的方式略有变动

/*by SilverN*/
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const int mxn=3000200;
struct que{
    int v;//val
    int p;//pos
};
que mx[mxn],mi[mxn];
int h1,h2,t1,t2;
int k,n;
int a[mxn];
int ans=0;
int main(){
    scanf("%d%d",&k,&n);
    int i,j;
    for(i=1;i<=n;i++)scanf("%d",&a[i]);
    h1=1;h2=1;t1=0;t2=0;
    int le=0;
    for(i=1;i<=n;i++){
        //max
        while(h1<=t1 && a[i]>=mx[t1].v)t1--;
        mx[++t1].v=a[i];
        mx[t1].p=i;
        //min
        while(h2<=t2 && a[i]<=mi[t2].v)t2--;
        mi[++t2].v=a[i];
        mi[t2].p=i;
        
        printf("test1 %d\n",mx[h1].v-mi[h2].v);
        while(mx[h1].v-mi[h2].v>k){//若两队首元素差大于k，更新队头 
            le=min(mx[h1].p,mi[h2].p)+1;
            while(le>mx[h1].p)h1++;//队首维护 
            while(le>mi[h2].p)h2++;
            
        }
        printf("test2 %d\n",mx[h1].v-mi[h2].v);
        ans=max(ans,i-le+1);
    }
    printf("%d\n",ans-1);
    return 0;
}