bzoj上的单调队列第一题,维护一个单调栈,让里面长度为d,再更新答案。
#include<bits/stdc++.h>
#define N 2000005
using namespace std;
long long n,p,d;
long long A[N+1],st,ans;
long long q[N+1],l,r;
inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline long long read()
{
long long x=0,b=1;
char c=nc();
for(;!(c<='9'&&c>='0');c=nc())if(c=='-')b=-1;
for(;c<='9'&&c>='0';c=nc())x=x*10+c-'0';
return x*b;
}
inline void write(long long x)
{
if(x==0)putchar('0');
else
{
char buf[25];
long long len=0;
if(x<0)putchar('-'),x=-x;
while(x)buf[++len]=x%10+'0',x/=10;
for(long long i=len;i>=1;i--)putchar(buf[i]);
}
putchar(' ');
}
int main()
{
freopen("in.txt","r",stdin);
n=read(),p=read(),d=read();
for(int i=1;i<=n;i++)A[i]=A[i-1]+read();
l=1,r=0,st=0,ans=d;
for(int i=d;i<=n;i++)
{
while(l<=r&&A[q[r]]-A[q[r]-d]<A[i]-A[i-d])r--;
q[++r]=i;
while(A[i]-A[st]-A[q[l]]+A[q[l]-d]>p)
{
st++;
if(q[l]-d<st)l++;
}
ans=max(ans,i-st);
}
cout<<ans;
return 0;
}