Cod sursa(job #2211973)
| Utilizator | Data | 12 iunie 2018 17:33:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#include<iostream>
#include<limits.h>
using namespace std;
int main(){
ifstream in("ssm.in");
int n,x,prevSum,bestSum, start=1, startAux, end=1;
in>>n>>prevSum; bestSum=prevSum;
for(int i=2;i<=n;i++){
in>>x;
if(prevSum+x<x) {
prevSum=x;
startAux=i;
}
else prevSum+=x;
if(bestSum<prevSum) {
bestSum=prevSum;
end=i; start=startAux;
}
}
in.close();
FILE *out=fopen("ssm.out","w");
fprintf(out,"%i %d %i",bestSum,start,end);
return 0;
}
