Maximum continuous subsequence -- daily question

Given  KK  A sequence of integers  {N0,N1,…,NK−1}{N0,N1,…,NK−1}, Its arbitrary continuous subsequence can be expressed as  {Ni,Ni+1,…,Nj}{Ni,Ni+1,…,Nj}, among  0≤i≤j<K0≤i≤j<K.

The largest continuous subsequence is the largest sum of all the elements in the continuous subsequence , For example, given a sequence  {−2,11,−4,13,−5,−2}{−2,11,−4,13,−5,−2}, The maximum continuous subsequence is  {11,−4,13}{11,−4,13} , The largest sum is  2020.

Write a program to get the sum of the largest subsequence and output the subscripts of the first and last elements of the subsequence .

Input format

Input contains multiple sets of test data .

The percentage of data in each group  22  That's ok , The first  11  Line gives a positive integer  KK.

The first  22  Line is given  KK  It's an integer  N1,…,NKN1,…,NK.

Output format

Output a row of results for each group of data , Contains the sum of the largest subsequence and the first subscript of the subsequence  ii  And the subscript of the last element  jj.

All elements are subscripted  0∼K−10∼K−1.

If the largest subsequence is not unique , select  ii  The smallest subsequence , If it's still not unique , select  ii  In the smallest subsequence  jj  The smallest subsequence .

If all  KK  Both elements are negative numbers , Then its maximum sum is defined as  00, Output  0 0 0.

Data range

1≤K≤1051≤K≤105,
−10000≤Ni≤10000−10000≤Ni≤10000,
The input can contain at most  1010  Group data .

sample input ：

8
6 -2 11 -4 13 -5 -2 10
5
10 -10 10 -10 10
8
-1 -5 -2 3 -1 0 -2 0
4 
-1 -2 -4 -3

sample output ：

27 0 7
10 0 0
3 3 3
0 0 0

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

const int N=100010;
int w[N];

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++) cin>>w[i];
        int res=0,left=0,right=0,f=0,g=0;
        for(int i=n-1;i>=0;i--)
        {
            if(f<=0)
            {
                f=0;
                g=i;
            }
            f+=w[i];
            if(f>=res)
            {
                res=f;
                left=i;
                right=g;
            }
        }
        cout<<res<<" "<<left<<" "<<right<<endl;
    }
    return 0;
}

2022/7/19