Cod sursa(job #490405)
Utilizator | Data | 6 octombrie 2010 15:30:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int N, X, L, S, SMAX, SP, SU;
int main(){
ifstream f1("ssm.in");
ofstream f2("ssm.out");
f1 >> N;
for (int i=1; i<=N; ++i) {
f1 >> X;
if (S < 0)
S = X, L = 1;
else S += X, ++L;
if (S > SMAX) {
SMAX = S;
SP = i-L+1;
SU = i;
}
}
f2 << SMAX << ' ' << SP << ' ' << SU;
return 0;
}