Cod sursa(job #1267992)
Utilizator | Data | 20 noiembrie 2014 15:46:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
long long i,n,suma[6000005],indinc=0,inc,sfr,minn=-666666666,sumamax=0;
in>>n;
for(i=1;i<=n;i++) in>>suma[i];
for(i=1;i<=n;i++)
{
suma[i]=suma[i]+suma[i-1];
if(sumamax<suma[i]-minn)
{
sumamax=suma[i]-minn;inc=indinc+1;sfr=i;
}
if(minn>suma[i])
{
minn=suma[i];indinc=i;
}
}
out<<sumamax<<' '<<inc<<' '<<sfr;
return 0;
}