Cod sursa(job #2531031)
Utilizator | Focsa Ionut-Madalin Madalin_Ionut | Data | 25 ianuarie 2020 16:17:19 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,a[6000003];
int main()
{
int s,smax,p,st,dr,i;
fin >> n;
for(i = 1;i <= n;++i)
fin >> a[i];
s = a[1]; p = 1;
smax = 0;
if(s < 0) {s = 0; p = 2;}
for(i = 2;i <= n;++i)
{
s += a[i];
if(s < 0) {s = 0; p = i + 1;}
if(s > smax) {smax = s; st = p; dr = i;}
}
fout << smax << " " << st << " " << dr << "\n";
fout.close();
return 0;
}