Cod sursa(job #1811571)
Utilizator | Data | 21 noiembrie 2016 12:38:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | gym1_emag_mediu_2016 | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000005], b[6000005], s, f, sm, n, i, j;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
b[i]=b[i-1]+a[i];
}
for(i=1;i<n;i++)
{
for(j=i;j<=n;j++)
{
if(b[j]-b[i-1]>sm)
{
sm=b[j]-b[i-1];
s=i;
f=j;
}
}
}
fout<<sm<<' '<<s<<' '<<f;
return 0;
}