ACM刷题之ZOJ————Java Beans
来源:互联网 发布:京东延保服务 知乎 编辑:程序博客网 时间:2024/06/14 12:05
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
25 27 3 1 3 96 613 28 12 10 20 75
Sample Output
16158
签到水题
下面是ac代码
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>#include<map>#include<set>#include<queue>#include<string>#include<iostream>using namespace std;#define MID(x,y) ((x+y)>>1)#define CLR(arr,val) memset(arr,val,sizeof(arr))#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);const double PI = acos(-1.0);const int INF = 0x3f3f3f3f;const int N=2e5+7;int a[11100];int main(){//freopen("f:/input.txt", "r", stdin);int zu,i,j,k,n,m,maxx,ma;scanf("%d",&zu);while(zu--){CLR(a,0);scanf("%d%d",&n,&m);for(i=0;i<n;i++){scanf("%d",&a[i]);a[i+n]=a[i];}maxx=0;for(i=0;i<m;i++){maxx+=a[i];}ma=maxx;for(i=0;i<2*n;i++){ma-=a[i];ma+=a[m+i];//printf("%d\n",ma);if(ma>maxx)maxx=ma;}printf("%d\n",maxx);}}
- ACM刷题之ZOJ————Java Beans
- ACM刷题之ZOJ————Defuse the Bomb
- ACM刷题之ZOJ———— People Counting
- ACM刷题之ZOJ————What day is that day?
- ACM刷题之ZOJ————Knuth-Morris-Pratt Algorithm
- ACM刷题之ZOJ————Marjar Cola
- ACM刷题之ZOJ————How Many Nines
- ACM刷题之ZOJ————Ace of Aces
- ACM刷题之ZOJ————Demacia of the Ancients
- ACM刷题之ZOJ————Lunch Time
- ACM刷题之ZOJ————May Day Holiday
- ACM刷题之ZOJ————Convert QWERTY to Dvorak
- ACM刷题之ZOJ————Break Standard Weight
- ACM刷题之ZOJ————Density of Power Network
- ACM刷题之ZOJ————Hard to Play
- ACM刷题之ZOJ————Let's Chat
- zoj 3714 Java Beans(简单题)
- zoj 3714 Java Beans
- Bundle传输数据之携带集合对象
- 第一篇博文
- OpenGL系列教程(3)——OpenGL基础(2)
- 如何学习一门语言
- 救基友记2
- ACM刷题之ZOJ————Java Beans
- android 如何去除textview imageview的图片,内容
- JAVA8接口中的default、static方法使用注意事项
- Tensorflow学习
- underscore.string
- eval()函数的注意事项
- 动态规划 04题
- CSUOJ 1869 树上最大数
- Hadoop eclipse使用jar运行实例