Cod sursa(job #1117678)
Utilizator | Data | 23 februarie 2014 18:51:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
using namespace std;
long a,s,maxx=-11111,pi=1,pf,i=1;
int n;
int main()
{
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;++i)
{
fscanf(f,"%lld",&a);
if(s<0)
{
pi=i;
s=0;
}
s+=a;
if(s>maxx)
{
pf=i;
maxx=s;
}
}
fprintf(g,"%lld %d %d",maxx,pi,pf);
return 0;
}