Max Sum
来源:互联网 发布:wps的数据透视表怎么用 编辑:程序博客网 时间:2024/06/13 22:20
Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 158949 Accepted Submission(s): 37195
Problem Description
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
Author
Ignatius.L
这个是回顾一下,之前不会。。现在知道了……
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int a[100000];
int main()
{
int T,N,i;
int count=1;
cin>>T;
while(T--)
{
memset(a,0,sizeof(a));
int sum=0;
int max=-1001;
int start=1,k=1,end=1;
cin>>N;
for(i=0;i<N;i++)
cin>>a[i];
for(i=0;i<N;i++)
{
sum=sum+a[i];
if(sum>max)
{ max=sum;
start=k;
end=i+1;
}
if(sum<0)
{
k=i+2;
sum=0;
}
}
printf("Case %d:\n",count++);
printf("%d %d %d\n",max,start,end);
if(T!=0)
cout<<endl;
}
return 0;
}
#include<stdio.h>
#include<string.h>
using namespace std;
int a[100000];
int main()
{
int T,N,i;
int count=1;
cin>>T;
while(T--)
{
memset(a,0,sizeof(a));
int sum=0;
int max=-1001;
int start=1,k=1,end=1;
cin>>N;
for(i=0;i<N;i++)
cin>>a[i];
for(i=0;i<N;i++)
{
sum=sum+a[i];
if(sum>max)
{ max=sum;
start=k;
end=i+1;
}
if(sum<0)
{
k=i+2;
sum=0;
}
}
printf("Case %d:\n",count++);
printf("%d %d %d\n",max,start,end);
if(T!=0)
cout<<endl;
}
return 0;
}
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
- iOS 中的UIWebView 和webkit 的联系使用
- HTML5让爱你和恨你都很痛苦
- AFNetworking 使用方法(2.0)
- 免费 PSD 下载: 20个精美的登录和注册表单
- Including iTunesArtwork in Ad Hoc distributions
- Max Sum
- AFNnetworking快速教程,官方入门教程译
- Vim自动补全插件----YouCompleteMe
- Jakarta Commons介绍
- jmeter wd结合
- 目标-动作机制(target - Action)
- 修改linux上mysql数据库编码
- zip文件格式
- sql错误1301 Result of CONCAT() was larger than max_allowed_packet(1024)-truncated