ZOJ 3714 Java Beans
2015-08-24 14:03
447 查看
Java Beans
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 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
Sample Output
排序问题
例1:找5 个数中连在一起的2个数最大
例2:找6 个数中连在一起的6个数最大
本题要用到一个环形查找 如21行所示
Time Limit: 2000MS | Memory Limit: 65536KB | 64bit IO Format: %lld & %llu |
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 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
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; }
相关文章推荐
- 二:HTML文本编译器 kindeditor-4.1.10 的使用 SpringMVC+jsp的实现
- Java反射机制详解
- Spring MVC 原理详解
- Java关键字之finalize
- Java关键字之finalize
- Java关键字之finalize
- java 字节流与字符流的区别
- Java进阶07 嵌套类
- eclipse svn 插件检出没有 .project 的项目
- JAVA中的反射机制
- eclipse 转 android studio (使用及遇到的问题集合)
- java生成/解析二维码
- java生成/解析二维码
- 深入理解Java内存模型之系列篇
- hessian java调用
- ECLIPSE实现了界面显示所有类
- [leetcode-257]Binary Tree Paths(java)
- spring配置jedisPool
- Missing artifact javax.jms:jms:jar: Missing artifact com.sun.jdmk Missing artifact com.sun.jmx:jmxri
- 【Developer Log】Java的内存使用、垃圾回收和内存泄漏