# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168899 | mousebeaver | Triple Jump (JOI19_jumps) | C++20 | 4097 ms | 1932 KiB |
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
vector<ll> a(n);
for(ll& i : a)
cin>>i;
ll q;
cin>>q;
while(q--)
{
ll l, r;
cin>>l>>r;
l--; r--;
ll output = 0;
for(ll i = l; i <= r; i++)
{
for(ll j = i+1; j <= r; j++)
{
for(ll k = j+(j-i); k <= r; k++)
{
output = max(output, a[i]+a[j]+a[k]);
# | 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... |