Cod sursa(job #613093)
Utilizator | Data | 15 septembrie 2011 19:45:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream.h>
#include <fstream.h>
#define N 6000000
ifstream f("ssm.in");
ofstream g("ssm.out");
int s[N];
int main()
{
int i,j,n,smin=0,ss=0,jmin,smax=-99999999,imin,aux=0;
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
for(i=1;i<=n;i++)
{
s[i]+=s[i-1];
if(smax<s[i]-smin)
smax=s[i]-smin, imin=aux+1, jmin=i;
if(smin>s[i])
smin=s[i], aux=i;
}
cout<<smax<<" "<<imin<<" "<<jmin;
return 0;
}