# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434008 | Maqsut_03 | Triple Jump (JOI19_jumps) | C++14 | 4090 ms | 3332 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<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 (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... |