Max Sum 初等dp

Max Sum

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1992 Accepted Submission(s): 758

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>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
#include <utility>
using namespace std;
int a[100005];
int main(){
    int T;
    int Case = 1;
    int n;
    cin >> T;
    while (T--) {
        memset(a, 0, sizeof(a));
                cin >> n;
        for (int i = 1; i <= n; ++i)
            cin >> a[i];
        
        int max_start = 1, max_end = 1, max_num = a[1], cur_num = a[1], x = 1;   //初始化不能为0， 因为可能存在负数， 那最大值就为0了

        for (int i = 2; i <= n; ++i) {
            cur_num += a[i];
            
            if (cur_num < a[i]) {
                cur_num = a[i];
                x = i;
            }
            //max_start 延迟更新，判断是不是真正的最大值区间
            if (cur_num > max_num) {
                max_start = x;
                max_end = i;
                max_num = cur_num;
            }
        }
        cout << "Case " << Case++ << ":" << endl;
        cout << max_num << " " << max_start << " " << max_end << endl;
        if (T)
            cout << endl;
    }
}