Cod sursa(job #755990)
Utilizator | Data | 8 iunie 2012 15:54:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<stdio.h>
using namespace std;
int main()
{
int x,sum=0,aux,st=1,n,dr,sf=(-1)*(1<<31);
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for(int i=1;i<=n;i++)
{
fscanf(f,"%d",&x);
if(sum+x<x)
{
sum=x;
aux=i;
}
else sum+=x;
if(sum>sf)
{
sf=sum;
st=aux;
dr=i;
}
}
printf(g,"%d %d %d",sf,st,dr);
return 0;
}