2014ACM集训13级PK赛3-Java Beans

Description

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 Mconsecutively 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

25 27 3 1 3 96 613 28 12 10 20 75

Sample Output

16158

 

 

又是暴力= =；

#include <stdio.h>#include <math.h>#include <stdlib.h>int kid[100];int main(){    int N;    scanf ("%d",&N);    while (N--)    {        int n,m;        int i,k;        scanf ("%d%d",&n,&m);        if (m > n)            return 0;        for (i = 0;i < n;i++)        {            scanf ("%d",&kid[i]);        }        int imax = 0;        for (i = 0;i < n;i++)        {            int sum = 0;            for (k = i;k < m + i;k++)            {                sum += kid[k % n];            }            if (sum > imax)                imax = sum;        }        printf ("%d\n",imax);    }    return 0;}