Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 108343 Accepted Submission(s): 24950
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
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这是一个最基本的求连续最大子串和问题,但笔者还是太弱了,搞了半天,都还是错的,我样例试了不少都过了,但是不知道错在那儿了,恳请各位大神斧正。下面是代码:#include<cstdio> #include<cstdlib> #include<cstring> #include<iostream> #include<cmath> using namespace std; int flag1=1,flag2=1,x=1; int Dpsum(int a[],int n){ int sum=a[0]; int count=0; int *b=(int *)malloc(n*sizeof(int)); b[0]=a[0]; for(int i=0;i<n;i++){ if(a[i]>0) count++; } for(int i=1;i<n;i++){ if(b[i-1]>=0){ b[i]=b[i-1]+a[i]; } else{ b[i]=a[i]; if(count==1){ x=i+1; break; } x=i+1; } } for(int j=0;j<n;j++){ if(b[j]>sum) { sum=b[j]; flag1=x; flag2=j+1; } } delete []b; return sum; } int main(){ int T; int n; int a[100000]; int count=1; scanf("%d",&T); while(T--){ scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); int ans=Dpsum(a,n); printf("case %d:\n",count); count++; printf("%d %d %d\n",ans,flag1,flag2); printf("\n"); } return 0; }