Cod sursa(job #3309190)

Utilizator serban19serban colhon serban19 Data 2 septembrie 2025 12:40:34
Problema Subsecventa de suma maxima Scor 60
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long int n,x,p1,p2,mp1=6000001,mp2=6000001;
long long int s[6000001],ma,v[6000001];
int main() {
    fin>>n;
    fin>>v[1];
    s[1]=v[1];
    ma=v[1];
    p1=1;
    for(long int i=2;i<=n;i++)
    {
        fin>>v[i];
        if (s[i-1] + v[i] > v[i])
            {s[i] = s[i-1]+v[i];p2=i;}
        else
            {s[i] = v[i];p1=i;}


        if(ma<s[i]){ma=s[i];
        mp1=p1;
        mp2=p2;
        }

    }
    fout<<ma<<" ";
    fout<<mp1<<" "<<mp2;
    return 0;
}