# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434008 | 2021-06-20T13:43:49 Z | Maqsut_03 | Triple Jump (JOI19_jumps) | C++14 | 4000 ms | 3332 KB |
#include<bits/stdc++.h> #define ll long long #define ss second #define ff first using namespace std; const int N = 222222; int n, m; ll a[N], b[N]; int main() { cin >> n; for (int i=1; i<=n; i++) cin >> a[i], b[i] = a[i]; cin >> m; int l, r, k, j; ll ans = 0; while (m--) { ans = 0; cin >> l >> r; for (int i=l; i<=r; i++) b[i] = a[i]; for (int i=r-1; i>=l; i--) b[i] = max(b[i], b[i+1]); for (int i=l; i<=r; i++) { j = 1; while (2*j+i<=r) ans = max(ans, 1ll*(a[i] + a[i+j] + b[i+j+1])), j++; } cout << ans << "\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 4090 ms | 3332 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |