题目
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
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5
Sample Output
Case 1:
14 1 4
Case 2:
7 1 6
题义
输入一串数字,输出这串数字中最大子序列的和的大小和起止位置。
思路
从第一位开始加和,若第一个小于-1000则不加,否则相加,若sum<0时,使sum等于0;以此类推,定义一个变量l储存和,若sum>l,则更新l的值为sum,求出最大值。
代码实现
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main()
{
int t,n,x;
cin>>t;
for(int j=0; j<t; j++)
{
cin>>n;
int sum=0,l=-1000,a=0,b=0,tem=1;
for(int i=0; i<n; i++)
{
cin>>x;
sum+=x;
if(sum>l)
{
l=sum;
a=tem;
b=i+1;
}
if(sum<0)
{
sum=0;
tem=i+2;
}
}
cout<<"Case "<<j+1<<":"<<endl;
cout<<l<<" "<<a<<" "<<b<<endl;
if(j!=t-1)
cout<<endl;
}
return 0;
}