Cod sursa(job #1946814)
Utilizator | Data | 30 martie 2017 15:10:06 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include<stdio.h>
using namespace std;
int main() {
FILE *fin, *fout;
int n, nr, sum, i, max, cs, min, l, poz, ccs, ccd;
fin=fopen("ssm.in", "r");
fout=fopen("ssm.out", "w");
fscanf( fin,"%d", &n);
sum=0;
cs=1;
max=0;
for(i=1;i<=n;i++) {
fscanf( fin, "%d", &nr);
sum=sum+nr;
if(sum<0) {
sum=0;
cs=i;
}
if(sum>max) {
max=sum;
ccs=cs;
ccd=i;
}
}
fprintf( fout, "%d %d %d", max, ccs+1, ccd);
fclose( fin );
fclose( fout );
return 0;
}