Cod sursa(job #640675)
Utilizator | Data | 26 noiembrie 2011 12:01:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
long n, i, sum, v, pozi, mf, mi, MAX;
int main() {
ifstream f("ssm.in");
ofstream h("ssm.out");
f>>n;
for (i = 1; i <= n; ++i) {
f>>v;
sum += v;
if (MAX < sum) {MAX = sum; mi = pozi; mf = i;}
if (sum < 0) {sum = 0; pozi = i + 1;}
}
h<<MAX<<" "<<mi<<" "<<mf;
return 0;
}