Cod sursa(job #272722)
Utilizator | Data | 7 martie 2009 18:29:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream.h>
#include<stdio.h>
FILE *f=fopen("ssm.in","r"),*g=fopen("ssm.out","w");
int main()
{
long n,x,sm,s,st=1,dr=1,i=0,r,l;
sm=s=0;
fscanf(f,"%ld",&n);
while(i++<n)
{
fscanf(f,"%ld",&x);
sm>=0?(dr=i,sm+=x):(st=dr=i,sm=x);
sm>s?s=sm,l=st,r=dr:0;
}
fprintf(g,"%ld %ld %ld\n",s,l,r);
return 0;
}