Cod sursa(job #2033632)
Utilizator | Data | 7 octombrie 2017 09:00:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000000],i,n,smax,s,start,stop,idx;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
smax=s=a[1];
if(s<0)s=0;
for(i=2;i<=n;i++)
{
s=s+a[i];
if(s>smax)
{smax=s;
start=idx;
stop=i;
}
if(s<0)
{s=0;
idx=i+1;
}
}
g<<smax<<" "<<start<<" "<<stop;
}