Cod sursa(job #1925860)
Utilizator | Ile Laurentiu Daniel LaurIle | Data | 13 martie 2017 19:33:15 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, st, fin, sum, maxsum=-2e9+10;
int a[6000005];
int main()
{
f >> n;
for(int i=1; i<=n; ++i)
f >> a[i];
f.close();
for(int i=1; i<=n; ++i)
{
if(sum<0)
{
sum = a[i]; st = i;
}
else
{
sum += a[i];
if(sum > maxsum)
{
maxsum = sum;
fin = i;
}
}
}
g << maxsum << ' ' << st << ' ' << fin << '\n';
g.close();
return 0;
}