ZOJ 3714 Java Beans

最新推荐文章于 2025-08-09 21:52:48 发布

原创最新推荐文章于 2025-08-09 21:52:48 发布 · 428 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #HDU #HDUOJ #c语言

ACM__水题专栏收录该内容

38 篇文章

订阅专栏

本文详细介绍了JavaBeans环形查找算法的实现过程及应用案例，包括输入输出规范、核心逻辑解析和代码实例演示。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Java Beans

Time Limit: 2000MS

Memory Limit: 65536KB

64bit IO Format: %lld & %llu

Submit Status

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

排序问题

例1：找5 个数中连在一起的2个数最大

例2：找6 个数中连在一起的6个数最大

本题要用到一个环形查找如21行所示

#include<stdio.h>
int main (void)
{
    int l[1500],T,a,i,b;
    int sum,max,j;
    scanf("%d",&T);
    while(T--)
    {
        sum=0;
        scanf("%d%d",&a,&b);
        for(i=0;i<a;i++)
        {
            scanf("%d",&l[i]);
        }
        max=0;
        for(i=0;i<a;i++)
        {
            sum=0;
            for(j=0;j<b;j++)
            {
                sum+=l[(i+j)%a];
            }
            if(sum>=max) max=sum;
        }
        printf("%d\n",max);
    }
    return 0;
}