ZOJ 3714 Java Beans
2015-09-06 13:46
351 查看
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
求连续M个数的最大和 环型
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
求连续M个数的最大和 环型
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; int main() { int T,n,m,a[10000]; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); a[n+i]=a[i]; } int sum=0; int s=0; for(int i=1;i<=m;i++)sum+=a[i]; for(int i=m+1;i<n+m;i++) { s=max(sum,s); sum=sum-a[i-m]+a[i]; } s=max(sum,s); printf("%d\n",s); } return 0; }
相关文章推荐
- Java主线程等待所有子线程执行完毕再执行解决办法集
- java在继承中父类的成员变量是否会被子类所覆盖
- java线程
- 为什么学java开发?
- java 大数加减法(小数,正负)
- SpringMVC中使用Interceptor拦截器
- Java Serializable(序列化)的理解和总结
- [Android]反编译apk + eclipse中调试smali
- JAR包不全!Unable to load configuration.-bean-jar:file:/.../struts2-core-2.2.1.jar!/struts-default.xml:7
- java 大数阶乘代码
- springmvc @ResponseBody 处理json返回406
- 全球镜像服务器站点代理配置信息
- java web项目直接通过ip访问无需输入端口号和项目名实现
- java 延迟程序
- 十进制与十六进制、二进制、八进制之间的转换(Java)
- struts2 Interceptor详解
- 使用Spring整合Hibernate,并实现对数据表的增、删、改、查的功能
- Struts 2的基石——拦截器(Interceptor)
- java提高篇(三十)-----Iterator
- Struts 2中的OGNL