要求一段连续区间和,可以用sum[i]-sum[j]来求,但要求一段长度不大于k的区间和的最大值,我们可以固定i,然后求
sum[i]-min{sum[j]},1<=i-j<=k
我们用单调队列来维护min{sum[j},每次枚举一个i时,队头元素的下标至少为i-k,然后求完sum[i]-min{sum[j]}后再将i放入队列中进行维护
代码:
#include<iostream>
#include<memory.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<ctime>
using namespace std;
const int MAX=200005;
const int inf=1<<30;
int pos[MAX],id[MAX],sum[MAX];
int main()
{
int i,j,T,n,k,st,end,head,tail;
int x,maxx;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&k);
sum[0]=0;
for(i=1;i<=n;i++)
{
scanf("%d",&pos[i]);
pos[i+n]=pos[i];
sum[i]=sum[i-1]+pos[i];
}
for(i=n+1;i<=2*n;i++)
sum[i]=sum[i-1]+pos[i];
maxx=-inf;
head=0;
pos[0]=0;
id[0]=0; tail=0;
for(i=1;i<=2*n;i++)
{
while(head<=tail&&i-id[head]>k)
head++;
if(sum[i]-pos[head]>maxx)
{
maxx=sum[i]-pos[head];
st=id[head]+1; end=i;
}
else if(sum[i]-pos[head]==maxx)
{
if(end-st>i-id[head])
{
st=id[head]+1; end=i;
}
}
while(head<=tail&&pos[tail]>=sum[i])
tail--;
pos[++tail]=sum[i];
id[tail]=i;
}
if(st>n)
st-=n;
if(end>n)
end-=n;
//if(st>end)
//swap(st,end);
printf("%d %d %d\n",maxx,st,end);
}
return 0;
}