Cod sursa(job #2787601)

Utilizator dotyzebra775Papuc Stefan dotyzebra775 Data 23 octombrie 2021 18:59:59
Problema Subsecventa de suma maxima Scor 75
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#define N 6000005
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");

int n, a[N];

int s[N], lg[N];

int main()
{
    int i, p, u;
    int smax = -2000000000;
    fin >> n;
    for(i = 1; i <= n; ++ i)
        fin >> a[i];
    s[1] = a[1];
    lg[1] = 1;
    for(i = 2; i <= n; ++ i)
        if(s[i-1] < 0)
        {
            s[i] = a[i];
            lg[i] = 1;
        }
        else
        {
            s[i] = s[i-1] + a[i];
            lg[i] = lg[i-1] + 1;
        }
    for(i = 1; i <= n; ++ i)
        if(s[i] > smax)
            smax = s[i];
    p = n;
    for(i = 1; i <= n; ++ i)
        if(s[i] == smax)
            if(i - lg[i] + 1 < p)
            {
                p = i - lg[i] + 1;
                u = i;
            }
    fout << smax << " " << p << " " << u;


    return 0;
}