Cod sursa(job #1004171)
| Utilizator | Data | 2 octombrie 2013 11:08:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int N, s, a, b, r, l;
int main() {
FILE *in = fopen("ssm.in", "r"), *out = fopen("ssm.out", "w");
fscanf(in, "%d %d %d", &N, &s, &a);
r = 1; l = 1;
for (int i = 1; i <= N - 2; i++) {
fscanf(in, " %d", &b);
if (s + a > a + b) {
r++;
s = s + a;
}
else {
s = a;
r = i + 1;
l = i + 1;
}
a = b;
}
fprintf(out, "%d %d %d", s, l, r);
}
