Cod sursa(job #1126522)
Utilizator | Data | 27 februarie 2014 00:13:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#include <algorithm>
#define NM 6000001
using namespace std;
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
int i,N,n,j,p,u,s,sm;
int main()
{
fscanf(f,"%d%d",&N,&s);
sm=s;
for(i=2;i<=N;i++)
{
fscanf(f,"%d",&n);
if(s>0) s+=n;
else {s=n; j=i;}
if(s>sm) {sm=s; p=j; u=i;}
}
fprintf(g,"%d %d %d",sm,p,u);
return 0;
}