# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199364 | houtaru | 3단 점프 (JOI19_jumps) | C++17 | 1356 ms | 77380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n, q;
int a[5010];
int f[5010][5010];
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = n - 1; i >= 0; --i) {
int cur = 0, mx = 0;
for (int j = i + 2; j < n; ++j) {
mx = max(mx, a[(i + j) / 2]);
f[i][j] = max({a[i] + a[j] + mx, f[i + 1][j], f[i][j - 1]});
}
}
cin >> q;
while (q--) {
int l, r; cin >> l >> r;
cout << f[l - 1][r - 1] << "\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |