Cod sursa(job #2472927)
Utilizator | Ichim Stefan Ykm911 | Data | 13 octombrie 2019 11:10:18 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int a[6000005];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int dr, st, n, i, s = 0, smax = -1e9, p;
st = dr = p = 1;
fin >> n;
for(i = 1; i <= n; i++)
fin >> a[i];
for(i = 1; i <= n; i++)
{
s += a[i];
if(s > smax)
{
smax = s;
st = p;
dr = i;
}
if(s < 0)
{
s = 0;
p = i + 1;
}
}
fout << smax <<" " << st <<" "<<dr;
return 0;
}