ZOJ 3714 Java Beans 解题报告

//Time:0ms
//Memory:196KB
//Length:599B
#include <iostream>
#include <cstdio>
#define MAXN 2010
#define INF 1000000000
using namespace std;
int num[MAXN];
int main()
{
//freopen("/home/moor/Code/input.txt","r",stdin);
int n,m,ncase,ans=0,sum=0;
scanf("%d",&ncase);
while(ncase--)
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i)    scanf("%d",&num[i]),num[i+n]=num[i];
ans=-INF;
sum=0;
for(int i=0;i<m;++i)    sum+=num[i];
ans=max(ans,sum);
for(int i=m;i<n+m;++i)
sum=sum+num[i]-num[i-m],ans=max(ans,sum);
printf("%d\n",ans);
}
return 0;
}