Java Beans

原址
*Time limit2000 ms
Memory limit65536 k
BOSLinux*

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 Ci (1 ≤ Ci ≤
1000) indicating number of java beans the ith 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
注：刚开始以为是挑选M个大的数
wa了之后仔细看题才知道是圆桌位子是不动的
这次数组没有开大，而是开小了
没发觉之前提交上去显示Segmentation Fault
才是知道是越界了，扩大一倍就A了

#include<stdio.h>
#include<string.h>
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,k,c[550];
        memset(c,0,sizeof(c));
        scanf("%d%d",&n,&k);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&c[i]);
            c[i+n]=c[i];
        }
        int sum[550];
        memset(sum,0,sizeof(sum));
        int max=0;
        for(int i=0; i<(2*n-1); i++)
        {
            for(int j=0; j<k; j++)
            {
                sum[i]+=c[i+j];
            }
            if(sum[i]>max)
                max=sum[i];
        }
        printf("%d\n",max);
    }
    return 0;
}