# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175395 | _ncng.nyr | Triple Jump (JOI19_jumps) | C++20 | 282 ms | 247228 KiB |
#include<bits/stdc++.h>
#define int long long
#define ii pair<int, int>
using namespace std;
const int N = 5e5 + 5;
int n, q;
int a[N];
ii query[N];
namespace sub1 {
void solve() {
for(int i = 1; i <= q; ++i) {
auto [l, r] = query[i];
int res = 0;
for(int x = l; x <= r; ++x)
for(int y = x + 1; y <= r; ++y)
for(int z = y + (y - x); z <= r; ++z) res = max(res, a[x] + a[y] + a[z]);
cout << res << '\n';
}
}
}
namespace sub2 {
int f[5'005][5'005], mx[5'005][5'005];
# | 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... |