[ACM_水题] ZOJ 3714 [Java Beans 环中连续m个数最大值]

There are N little kids sitting in a circle, each of them are carrying some java beans in their hand. Their teacher want to select M kids who seated in M consecutive seats and collect java beans from them.

The teacher knows the number of java beans each kids has, now she wants to know the maximum number of java beans she can get from M consecutively seated kids. Can you help her?

Input

There are multiple test cases. The first line of input is an integer T indicating the number of test cases.

For each test case, the first line contains two integers N (1 ≤ N ≤ 200) and M (1 ≤ M ≤ N). Here N and M are defined in above description. The second line of each test case contains N integers C_i (1 ≤ C_i ≤ 1000) indicating number of java beans the i^th kid have.

Output

For each test case, output the corresponding maximum java beans the teacher can collect.

Sample Input

2
5 2
7 3 1 3 9
6 6
13 28 12 10 20 75

Sample Output

16
158

---

Author: FAN, Yuzhe
Contest: The 10th Zhejiang Provincial Collegiate Programming Contest

题目大意：有N个人坐成一圈，每个人有Ci个糖果，老师想找M个连续坐的同学中获得最多的糖果，问最多几个？

解题思路：最大连续和问题，这里连续数字个数为M,采用b[i]维护前i个糖果总和，那么求从i+1开始M个的总和就是：b[i+M]-b[i],枚举从i=0到i=N-1求最大值即可。

 #include<iostream>
 #include<algorithm>
 using namespace std;
 int main(){
     int T;
     cin>>T;
     int a[],b[];
     while(T--){
         int N,M;
         cin>>N>>M;
         for(int i=;i<;i++)b[i]=;
         for(int i=;i<N;i++){
             cin>>a[i];
             if(i==)b[i]=a[i];
             else b[i]=b[i-]+a[i];
         }//边输入边维护一个前i个数之和b[i]
         for(int i=N;i<*N;i++){
             b[i]=b[i-]+a[i%N];
         }//继续维护b[i]使之满足一个环遍历的要求
         int max=-;
         for(int i=;i<N;i++){
             int sum=b[i+M]-b[i];
             if(sum>max)max=sum;
         }//取得长为M的最大连续和
         cout<<max<<'\n';
     }return ;

 }