# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096820 | nvgbao08 | Triple Jump (JOI19_jumps) | C++14 | 2 ms | 348 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>
using namespace std;
#define thanchu() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define read(n,a) for (int i=1; i<=n; i++) cin>>a[i];
#define readln(n,a,pp) for (int i=1; i<=n; i++) {cin>>a[i]; pp[a[i]]++;}
#define ull unsigned long long int
#define task "TEXT"
const long long maxn=1e6+4;
long long n,m,a[maxn+1],d=0,s[maxn+1];
void doc()
{
#ifndef ONLINE_JUDGE
freopen(task".INP", "r", stdin);
freopen(task".OUT", "w", stdout);
#endif
cin>>n;
read(n,a);
cin>>m;
}
void trau()
{
while (m--)
{
int l, r;
cin>> l >>r;
long long ma=LLONG_MIN;
for (int x=l; x<=r-2; ++x)
{
for (int y=x+1; y<=(r+x)/2; ++y)
{
for (int z=2*y-x; z<=r; ++z)
{
ma=max(ma, a[x]+a[y]+a[z]);
}
}
}
cout<<ma<<endl;
}
}
void xuly()
{
while (m--)
{
int l,r;
cin>>l>>r;
long long x=l,m_ai=a[l],ma=LLONG_MIN;
for (int y=x+1; y<=(r+x)/2; ++y)
{
for (int z=2*y-x; z<=r; ++z)
{
ma=max(ma, m_ai+a[y]+a[z]);
}
if (a[y]>=m_ai)
{
m_ai=a[y];
x=y;
}
}
cout<<ma<<endl;
}
}
signed main()
{
thanchu();
doc();
xuly();
}
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... |