# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242308 | tqbfjotld | 3단 점프 (JOI19_jumps) | C++14 | 4061 ms | 37292 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;
long long arr[500005];
long long memo[5005][5005];
struct node{
int s,e;
long long v;
node *l,*r;
node(int _s, int _e){
s = _s;
e = _e;
if (s==e) v = arr[s];
else{
l = new node(s,(s+e)/2);
r = new node((s+e)/2+1,e);
v = max(l->v,r->v);
}
}
long long qu(int a, int b){
if (b<a) return -99999999999999LL;
if (a<=s && e<=b) return v;
if (a<=(s+e)/2) return l->qu(a,b);
if (b>(s+e)/2) return r->qu(a,b);
return max(l->qu(a,b),r->qu(a,b));
}
}*root;
int main(){
int n,q;
scanf("%d",&n);
for (int x = 0; x<n; x++){
scanf("%lld",&arr[x]);
}
scanf("%d",&q);
if (false){
for (int x = 0; x<q; x++){
int l,r;
scanf("%d%d",&l,&r);
l--;r--;
long long ans = 0;
for (int a = l; a<=r; a++){
for (int c = a+2; c<=r; c++){
for (int b = a+1; c-b>=b-a; b++){
ans = max(ans,arr[a]+arr[b]+arr[c]);
}
}
}
printf("%lld\n",ans);
}
}
else{
root = new node(0,n);
for (int x = 0; x<n; x++){
for (int y = 0; y<n; y++){
memo[x][y] = root->qu(x+1,(x+y)/2) + arr[x]+arr[y];
}
}
for (int x = 0; x<n; x++){
for (int y = 1; y<n; y++){
memo[x][y] = max(memo[x][y],memo[x][y-1]);
}
}
for (int x = n-2; x>=0; x--){
for (int y = 0; y<n; y++){
memo[x][y] = max(memo[x][y],memo[x+1][y]);
}
}
for (int x = 0; x<q; x++){
int l,r;
scanf("%d%d",&l,&r);
l--;r--;
printf("%lld\n",memo[l][r]);
}
}
}
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... |