Cod sursa(job #430939)
Utilizator | Moise Razvan Bunicool | Data | 31 martie 2010 14:49:24 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<cstdio>
using namespace std;
FILE *f=fopen("ssm.in","r"), *g=fopen("ssm.out","w");
long elem,n,max,i,j,sume[6000000],inc,sf=1;
int main()
{
fscanf(f,"%ld",&n);
for(i=0;i<n;i++)
{
fscanf(f,"%ld",&elem);
if(i==0)
sume[0]=elem;
else
{
sume[i]=sume[i-1]+elem;
if(i==1) max=sume[i];
for(j=0;j<i;j++)
if(max<sume[i]-sume[j])
{
max=sume[i]-sume[j];
inc=j+2;
sf=i+1;
}
}
}
fprintf(g,"%ld %ld %ld",max,inc,sf);
return 0;
}