Cod sursa(job #328805)
Utilizator | Data | 3 iulie 2009 13:47:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<stdio.h>
using namespace std;
long int sum,max,i,lung,p,x,n,poz;
int main()
{
FILE *f=fopen("ssm.in","r"), *g=fopen("ssm.out","w");
fscanf(f,"%ld%ld",&n,&x);
poz=0; p=1; lung=1;
max=sum=x;
for(i=2;i<=n;i++)
{fscanf(f,"%ld",&x);
if(sum<0)
{sum=x;p=i;}
else sum=sum+x;
if(max<sum)
{max=sum; poz=p; lung=i-p+1;}
}
fprintf(g,"%ld %ld %ld\n",max,poz,poz+lung-1);
fclose(f);
fclose(g);
return 0;
}