PAT(Advanced) 1007 Maximum Subsequence Sum (25)

2018/4/20

// 注意题目说的，当所有的数都是非负数（有0不算）的时候最大数为0
// 输出最大子序列和的首、末元素值，而不是下标

#include <iostream>
using namespace std;

int num[10005];

int main(){
    int maxnum = 0, start, endnum;

    int n;
    bool flag = false;
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> num[i];
        if(num[i] >= 0)
            flag = true;
    }

    if(flag == false){
        cout << maxnum << ' ' << num[0] << ' ' << num[n-1] << endl;
        return 0;
    }

    for(int i = 0; i < n; i++){
        int cursum = 0;

        for(int j = i; j < n; j++){
            cursum += num[j];
            if(cursum > maxnum){
                maxnum = cursum;
                start = num[i];
                endnum = num[j];
            }
        }
    }

    cout << maxnum << ' ' << start << ' ' << endnum << endl;


    return 0;
}