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