Cod sursa(job #1371542)
Utilizator | Data | 3 martie 2015 22:09:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000030],S,inc,bestS,incep,termin;
int main()
{
f >> n;
for(int i = 1; i <= n; i++)
f >> a[i];
for(int i = 1; i <= n; i++){
if(S < 0){
S = a[i];
inc = i;
}else{
S += a[i];
}
if(bestS < S){
bestS = S;
incep = inc;
termin = i;
}
}
g << bestS <<" "<< incep <<" "<<termin;
return 0;
}