Cod sursa(job #589114)
| Utilizator | Data | 10 mai 2011 21:41:49 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
using namespace std;
int main(void)
{
int n,i,s,x,y,sm,val,st;
FILE *f=fopen("ssm.in","rt");
FILE *g=fopen("ssm.out","wt");
fscanf(f,"%i",&n);
st=1;
fscanf(f,"%i",&s);
sm=s;
x=y=1;
for (i=2;i<=n;i++)
{
fscanf(f,"%i",&val);
if (s>=0) s+=val;
else {s=val; st=i;}
if (s>sm) {sm=s; x=st; y=i;}
}
fclose(f);
fprintf(g,"%i %i %i\n",sm,x,y);
return 0;
}
