- Max Sum
来源:互联网 发布:淘宝热销产品排行榜 编辑:程序博客网 时间:2024/05/21 11:05
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample Output
Case 1:14 1 4Case 2:7 1 6
#include<cstdio>
#include<algorithm>using namespace std;
int main()
{
int t,l=1;
int a[100005];
scanf("%d",&t);
while(t--)
{
int n;
int sum=0;
int end,star,k=1;
int max=-1000;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++)
{
sum=sum+a[i];
if(sum>max)
{
max=sum;
star=k;
end=i;
}
if(sum<0)
{
sum=0;
k=i+1;
}
}
printf("Case %d:\n",l++);
printf("%d %d %d\n",max,star,end);
if(t!=0)
printf("\n");
}
return 0;
}
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample Output
Case 1:14 1 4Case 2:7 1 6
0 0
- Max Sum
- Max Sum
- Max Sum
- max sum
- Max Sum
- Max Sum
- MAX SUM
- Max Sum
- Max Sum
- max sum
- Max Sum
- Max sum
- Max Sum
- Max sum
- Max Sum
- Max Sum
- Max Sum
- max sum
- 如何快捷查看PPT页数 统计PPT页数
- 解决angularjs使用iframe加载网址的跨域请求
- 如何推送喜欢的书籍到kindle
- 学生知识点总结之一(GetSetting,SaveSetting)
- <mysql> 特殊技巧
- - Max Sum
- Lua常用方法分析
- haproxy安装文档
- 一段简单的jquery邮箱验证代码
- 推荐手机H5应用快速开发 UI库(Framework7、SUI(淘宝)、MUI、WeUI(微信)、GMU(百度)、Frozen UI(QQ))
- 搬瓦工(bandwagonhost.com) centos6 pptpd iptables 设置
- 2016暑假的好题
- 15、CSS3-响应式布局
- 重温应用程序的生命周期