ZCMU训练赛-J(循环节+字符串处理)
J - Java Beans
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 Mconsecutively 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 Nintegers 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
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int a[];
bool cmp(const int &a,const int &b)
{
return a>b;
}
int main()
{
int t;
int n,m,i,j,k;
int a[];
scanf("%d",&t);
while(t--)
{
int b[]={};
scanf("%d%d",&n,&m);
for(i=;i<n;i++)
scanf("%d",&a[i]); for(i=;i<n;i++)
{
for(j=i,k=;j<n+,k<m;j++,k++)
{
if(j==n)
j=;
b[i]+=a[j];
}
}
sort(b,b+n);
printf("%d\n",b[n-]);
}
return ;
}
#include<stdio.h>
int d[];
int main(int argc, char* argv[])
{
int t,i,j;
int n,m,sum,max;
while(scanf("%d",&t)!=EOF)
{
while(t--)
{
scanf("%d%d",&n,&m);
for(i=;i<n;i++)
scanf("%d",&d[i]); max=;
for(i=;i<n;i++)
{
sum=;//注意复位
for(j=i;j<i+m;j++)
sum+=d[j%n];
if(max<sum)
max=sum;
}
printf("%d\n",max);
}
}
return ;
}
最新文章
- ASP.NET MVC Razor
- 【mysql】关于悲观锁
- R语言:规划求解优化ROI
- SP2-0618: 无法找到会话标识符。启用检查 PLUSTRACE 角色 SP2-0611: 启用 STATISTICS 报告时出错
- kmp模板,线性完成pos
- Struts2 验证规则配置文件
- NPOI高效匯出Excel
- ArcGIS 投影转换(AE)
- memcache缓存命中深入理解转载
- WebService 使用wsdl.exe生成代理类
- Jquery实现鼠标移到某个对象,弹出显示层。
- Codeforces 1092C Prefixes and Suffixes(思维)
- JS使用小记
- [asp.net core]SignalR一个例子
- Linux网络编程学习(五) ----- 信号(第四章)
- css中元素border属性的构成以及配合属性值transparent可得到一些特殊形状1.0
- 20155215 2016-2017-2 《Java程序设计》第9周学习总结
- 将获得datebox值的文本形式转为日期格式
- 再读c++primer plus 004
- IntentService 与ResultReceiver