Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 188172 Accepted Submission(s): 43845
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 "iostream" using namespace std; int k[100005]; int main(){ int l,r,sum = 0,n,maxn = -1001; int t,p = 0; cin >> t; while(t--) { cin >> n; for(int i = 0; i < n; i++) cin >> k[i]; for(int i = 0; i < n; i++) { sum = 0; for(int j = i; j < n; j++){ sum += k[j]; if(sum > maxn) { maxn = sum; l = i; r = j; } if(sum < 0) { // 关键在这里,抛弃和小于0的子串; i = j; sum = 0; break; } } } if(p) cout << endl; cout << "Case " << ++p << ":" << endl; cout << maxn << " " << l+1 << " " << r+1 << endl; maxn = -1001; } }