Cod sursa(job #306922)
Utilizator | Bogdan Vlad bugy | Data | 22 aprilie 2009 13:26:50 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<stdio.h>
using namespace std;
long int i,j,s,smax,li,ls,n;
long int v[6000001];
int main()
{
FILE *f=fopen("ssm.in","r"), *g=fopen("ssm.out","w");
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
fscanf(f,"%ld",&v[i]);
smax=v[1];
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=n;j++)
{
s=s+v[j];
if(s>smax)
{smax=s;
li=i;
ls=j;}
}
}
fprintf(g,"%ld %ld %ld",smax,li,ls);
fprintf(g,"\n");
fclose(f);
fclose(g);
return 0;
}