HDU--杭电--3415--Max Sum of Max-K-sub-sequence--暴力或单调队列
来源:互联网 发布:阿里云 mysql 编辑:程序博客网 时间:2024/05/16 14:24
Max Sum of Max-K-sub-sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4913 Accepted Submission(s): 1791
Now your job is to calculate the max sum of a Max-K-sub-sequence. Max-K-sub-sequence means a continuous non-empty sub-sequence which length not exceed K.
Then T lines follow, each line starts with two integers N , K(1<=N<=100000 , 1<=K<=N), then N integers followed(all the integers are between -1000 and 1000).
46 36 -1 2 -6 5 -56 46 -1 2 -6 5 -56 3-1 2 -6 5 -5 66 6-1 -1 -1 -1 -1 -1
7 1 37 1 37 6 2-1 1 1
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int a[222222],sum[222222]={0},que[222222];
int main (void)
{
int t,n,m,s,i,j,k,l,max,aa,ss,qian,hou;
scanf("%d",&t);
while(t--&&scanf("%d%d",&n,&m))
{
for(i=1;i<=n;i++)
scanf("%d",&a[i]),a[n+i]=a[i];
for(i=1,sum[0]=0;i<=n+m;i++)
sum[i]=sum[i-1]+a[i]; //把总和记录下来
max=-1000000,aa=ss=qian=hou=0;
for(i=1;i<n+m;i++)
{
while(qian<hou&&sum[i-1]<sum[que[hou-1]])hou--; //保持单调
que[hou++]=i-1;
while(qian<hou&&i-que[qian]>m)qian++; //保持长度
if(sum[i]-sum[que[qian]]>max)
{
max=sum[i]-sum[que[qian]];
aa=que[qian]+1;ss=i;
}
}
if(aa>n)aa-=n;
if(ss>n)ss-=n;
printf("%d %d %d\n",max,aa,ss);
}
return 0;
}
- HDU--杭电--3415--Max Sum of Max-K-sub-sequence--暴力或单调队列
- HDU Max Sum of Max-K-sub-sequence(单调队列)
- HDU--杭电--3415--Max Sum of Max-K-sub-sequence--队列--双向队列
- hdu 3415 Max Sum of Max-K-sub-sequence【单调队列】
- HDU 3415 Max Sum of Max-K-sub-sequence(单调队列)
- HDU 3415 Max Sum of Max-K-sub-sequence(单调队列)
- hdu 3415 Max Sum of Max-K-sub-sequence(单调队列)
- HDU 3415 Max Sum of Max-K-sub-sequence[单调队列优化dp]
- 【单调队列】hdu 3415 Max Sum of Max-K-sub-sequence
- hdu 3415 Max Sum of Max-K-sub-sequence 单调队列dp
- HDU 3415(Max Sum of Max-K-sub-sequence-单调队列优化DP)
- hdu 3415 Max Sum of Max-K-sub-sequence (单调队列)
- HDU 3415 Max Sum of Max-K-sub-sequence【单调队列】
- HDU--3415--Max Sum of Max-K-sub-sequence--单调队列
- hdu 3415 Max Sum of Max-K-sub-sequence (单调队列)
- 单调队列-hdu-3415-Max Sum of Max-K-sub-sequence
- 单调队列——HDU 3415 Max Sum of Max-K-sub-sequence
- hdu 3415 Max Sum of Max-K-sub-sequence(单调队列)
- 一个硬中断的完整处理过程(2.4.24版本)
- poj2773 Happy 2006 二分+容斥
- ContaCamw编译手记
- android 来电大头贴显示流程
- 9.1-2 Find the second smallest of n elements.
- HDU--杭电--3415--Max Sum of Max-K-sub-sequence--暴力或单调队列
- DrawText函数
- 关于ListView中notifyDataSetChanged()刷新数据不更新原因
- 为OpenStack制作CentOS镜像的一种方法
- WEB测试要点总结
- Linux exec函数族
- 基于 equals() 的 键值同步锁: generic key managed concurrent lock map
- mysql 触发器
- Oracle log 状态说明