Nu aveti permisiuni pentru a descarca fisierul grader_test45.ok
Cod sursa(job #541432)
Utilizator | Data | 25 februarie 2011 11:08:27 | |
---|---|---|---|
Problema | Lazy | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Romanian Master in Mathematics and Sciences 2011, Ziua 1 | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const char iname[] = "lazy.in";
const char oname[] = "lazy.out";
const int MAXN = 7000005;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++ i)
#define Max(a, b) ((a) > (b) ? (a) : (b))
int main(void) {
ifstream in(iname);
int n, S;
int bestSum = -int(2e9), sum = 0, beg, end, idx;
in >> n;
FOR (i, 1, n) {
in >> S;
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (bestSum < sum)
bestSum = sum, beg = idx, end = i;
}
ofstream out(oname);
out << bestSum << " " << beg << " " << end;
in.close(), out.close();
return 0;
}