Cod sursa(job #933519)
| Utilizator | Data | 30 martie 2013 01:02:25 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <cstdio>
using namespace std;
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
#define Nmax 6000001
int N,s[Nmax],best=-int(2e9),inc,x,sf,i,sum;
int main()
{
fscanf(f,"%d",&N);
for(i=1;i<=N;i++)
fscanf(f,"%d",&s[i]);
for(i=1;i<=N;i++)
{
if(sum<0)
{
sum=s[i];
x=i;
}
else
sum+=s[i];
if(best<sum)
{
best=sum;
inc=x;
sf=i;
}
}
fprintf(g,"%d %d %d",best,inc,sf);
fclose(f);
fclose(g);
return 0;
}
