PTA 1007 Maximum Subsequence Sum (25 分)

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
#include <cassert>
#include <queue>
using namespace std; 
int n; 
int main()
{
        cin >> n;
       
        vector<int> vec(n);
        // for(int i = 0 ;i< n;++i)
        // {
        //         int x;
        //         cin >> x;
        //         vec.push_back(x); 
        // }
        int temp = 0,left = 0,right = n - 1,sum = -1; 
        int tempidx = 0;
        for(int i = 0;i < n; ++i)
        {
                cin >> vec[i];
                temp += vec[i];
                if(temp < 0)
                {
                        temp = 0;
                        tempidx = i + 1;
                }
                else if(temp > sum)
                {
                        sum = temp;
                        right = i;
                        left = tempidx;
                }
        }
        if(sum < 0)
        sum = 0;

        cout << sum << " " << vec[left] << " " << vec[right] << endl;
}