Cod sursa(job #2132964)
Utilizator | Data | 16 februarie 2018 12:35:40 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <stdio.h>
using namespace std;
FILE *f,*g;
int main()
{
f=fopen("ssm.in","r");
g=fopen("ssm.out","w");
int i,sum=0,smax=0,ii,jj,aux,n,x;
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&x);
if(sum<0)
{
sum=x;
aux=i;
}
else
sum+=x;
if(sum>smax)
{
smax=sum;
ii=aux;
jj=i;
}
}
fprintf(g,"%d %d %d",smax,ii,jj);
return 0;
}