Cod sursa(job #3165406)

Utilizator TeodorG8Cirstov Teodor TeodorG8 Data 6 noiembrie 2023 09:21:29
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.52 kb
#include <bits/stdc++.h>
using namespace std;

ifstream fin("ssm.in");
ofstream fout("ssm.out");

int v[6000001],x,n,poz1,poz2,cmax,s;

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        fin>>v[i];
    s=v[1];
    for(int i=2; i<=n; i++)
    {
        if(s+v[i]>v[i])
        {
            poz2=i;
            s+=v[i];
        }
        else if(s+v[i]<v[i])
        {
            poz1=i;
            s=v[i];
        }
    }
    if(v[n]<0)
        poz2++;
    fout<<s<<" "<<poz1<<" "<<poz2;
}