Cod sursa(job #1362014)
| Utilizator | Data | 26 februarie 2015 09:24:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include<stdio.h>
using namespace std;
FILE *f,*g;
int main()
{
int i,n,s,smax=0,p,c,p1,p2;
f=fopen("ssm.in","r");
g=fopen("ssm.out","w");
fscanf(f,"%d",&n);
s=0;
p=1;
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&c);
s+=c;
if(s>smax) {smax=s; p1=p; p2=i;}
if(s<0) {s=0; p=i+1;}
}
fprintf(g,"%d %d %d",smax,p1,p2);
fclose(f);
fclose(g);
return 0;
}
