Cod sursa(job #2170602)
Utilizator | Data | 15 martie 2018 08:54:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v[6000005];
int main()
{
int n;
fin>>n;
for (int i=1;i<=n;i++) {
fin>>v[i];
}
int bestSum=-int(2e9),sfarsit=0,inceput=0,idx=0,minim=0;
for (int i=1;i<=n;i++) {
v[i]+=v[i-1];
if (bestSum<v[i]-minim) inceput=idx+1,sfarsit=i,bestSum=v[i]-minim;
if (minim>v[i]) minim=v[i],idx=i;
}
fout<<bestSum<<" "<<inceput<<" "<<sfarsit;
fin.close();
fout.close();
return 0;
}