動态规划专题.doc

Max Sum Time Limit : 2000/1000ms (Java/Other)???Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 42???Accepted Submission(s) : 20 Font:?Times New Roman?|?Verdana?|?Georgia Font Size:?←?→ 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 Author Ignatius.L max?sum?/showproblem.php?pid=1003?????同上,最大连续子序列???????? #includestdio.h #define min int sta,end; int main() { int n,i,j,t,sum,maxsum,in,b; scanf(%d,n); for(i=0;in;i++) { sum=0;maxsum=min;sta=0; scanf(%d,t); for(b=j=0;jt;j++) { scanf(%d,in); sum+=in; if(summaxsum) { maxsum=sum; end=j; sta=b; } if(sum0) { sum=0; b=j+1; } } printf(Case %d:\n%d %d %d\n,i+1,maxsum,sta+1,end+1); if(i!=n-1) printf(\n); } return 0; } /////////////////////////////////////////////////// #include?iostreamusing?namespace?std;int?main(){????int?T,N,num,start,end;????cinT;????for(int?k=0;kT;k++)????{???