1007 Maximum Subsequence Sum

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;

int main(void) {
    int n;
    int a[10000];
    int sum = 0, maxSum = -1;
    int tmp_i = 0, index_i = 0, index_j = 0;

    cin >> n;
    for(int i = 0; i < n;+ ++i) {
        cin >> a[i];
    }

    for(int i = 0; i < n;+ ++i) {
        sum += a[i];

        if(sum > maxSum) {
            maxSum = sum;
            index_i = tmp_i;
            index_j = i;
        }

        if(sum < 0) {
            sum = 0;
            tmp_i = i+1;
        }

    }
    if(maxSum == -1)
        cout << 0 << ' ' << a[0] << ' ' << a[n-1] << endl;
    else
        cout << maxSum << ' ' << a[index_i] << ' ' << a[index_j] << endl;

    return 0;
}