zoj 3714 Java Beans(简单题)

最新推荐文章于 2020-10-30 18:24:44 发布

原创最新推荐文章于 2020-10-30 18:24:44 发布 · 1.3k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

竞赛专栏收录该内容

71 篇文章

订阅专栏

本文探讨了一道经典的算法题目：给定一组数值，找出连续的M个数的最大总和。通过滑动窗口的方法实现了一个高效的算法解决方案，并提供了一段完整的C++代码示例。

1、http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3714

2、题目

Java Beans

Time Limit: 2 Seconds Memory Limit: 65536 KB

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

3、Ac代码;

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[405];
int main()
{
    int n,m;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            a[i+n]=a[i];
        }
        int maxx=-1;
        for(int i=1;i<=n;i++)
        {
            int sum=0;
            for(int j=i;j<i+m;j++)
            {
                sum+=a[j];
            }
            if(sum>maxx)
            maxx=sum;
        }
        printf("%d\n",maxx);
    }
    return 0;
}