Cod sursa(job #1656981)
| Utilizator | Data | 20 martie 2016 00:04:32 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int N,S,beg,fin,index,sum,maxsum;
int main()
{
FILE *f =fopen("ssm.in","r");
FILE *f2=fopen("ssm.out","w");
fscanf(f,"%d",&N);
int i;
for(i=0 ;i<N ;i++){
fscanf(f,"%d",&S);
if(sum <0){
sum =S;
index=i;
}
else sum+=S;
if(maxsum<sum){
maxsum=sum;
beg=index;
fin=i;
}
}
fprintf(f2,"%d %d %d",maxsum,beg+1,fin+1);
fclose(f);
fclose(f2);
return 0;
}
