이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=500050;
const int M=2*N;
int n,q,a[N],mx1[M],mx2[M],lzy[M],root,tsz,ls[M],rs[M],ans[N];
vector<pair<int,int>> Qs[N];
void push(int c,int ss,int se){
if(ss!=se){
mx2[ls[c]]=max(mx2[ls[c]],mx1[ls[c]]+lzy[c]);
mx2[rs[c]]=max(mx2[rs[c]],mx1[rs[c]]+lzy[c]);
lzy[ls[c]]=max(lzy[ls[c]],lzy[c]);
lzy[rs[c]]=max(lzy[rs[c]],lzy[c]);
}
lzy[c]=-1e9;
}
void Build(int&c,int ss,int se){
c=++tsz,mx2[c]=lzy[c]=-1e9;
if(ss==se){mx1[c]=a[ss];return;}
int mid=ss+se>>1;
Build(ls[c],ss,mid);
Build(rs[c],mid+1,se);
mx1[c]=max(mx1[ls[c]],mx1[rs[c]]);
}
void Set(int c,int ss,int se,int qs,int qe,int x){
if(ss>se||ss>qe||se<qs)return;
if(qs<=ss&&se<=qe){
mx2[c]=max(mx2[c],mx1[c]+x);
lzy[c]=max(lzy[c],x);
push(c,ss,se);
return;
}
push(c,ss,se);
int mid=ss+se>>1;
Set(ls[c],ss,mid,qs,qe,x);
Set(rs[c],mid+1,se,qs,qe,x);
mx2[c]=max(mx2[ls[c]],mx2[rs[c]]);
}
int Get(int c,int ss,int se,int qs,int qe){
if(ss>se||ss>qe||se<qs)return -1e9;
if(qs<=ss&&se<=qe)return mx2[c];
push(c,ss,se);
int mid=ss+se>>1;
return max(Get(ls[c],ss,mid,qs,qe),Get(rs[c],mid+1,se,qs,qe));
}
void Add(int i,int j){Set(root,1,n,2*j-i,n,a[i]+a[j]);}
int main(){
scanf("%i",&n);
for(int i=1;i<=n;i++)scanf("%i",&a[i]);
scanf("%i",&q);
for(int i=1;i<=q;i++){
int l,r;scanf("%i%i",&l,&r);
Qs[l].pb({r,i});
}
Build(root,1,n);
vector<int> stk;
for(int i=n;i>=1;i--){
while(!stk.empty()&&a[stk.back()]<=a[i])Add(i,stk.back()),stk.pop_back();
if(!stk.empty())Add(i,stk.back());
stk.pb(i);
for(auto qs:Qs[i])ans[qs.second]=Get(root,1,n,i,qs.first);
}
for(int i=1;i<=q;i++)printf("%i\n",ans[i]);
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
jumps.cpp: In function 'void Build(int&, int, int)':
jumps.cpp:20:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
20 | int mid=ss+se>>1;
| ~~^~~
jumps.cpp: In function 'void Set(int, int, int, int, int, int)':
jumps.cpp:34:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
34 | int mid=ss+se>>1;
| ~~^~~
jumps.cpp: In function 'int Get(int, int, int, int, int)':
jumps.cpp:43:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
43 | int mid=ss+se>>1;
| ~~^~~
jumps.cpp: In function 'int main()':
jumps.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
48 | scanf("%i",&n);
| ~~~~~^~~~~~~~~
jumps.cpp:49:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
49 | for(int i=1;i<=n;i++)scanf("%i",&a[i]);
| ~~~~~^~~~~~~~~~~~
jumps.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
50 | scanf("%i",&q);
| ~~~~~^~~~~~~~~
jumps.cpp:52:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
52 | int l,r;scanf("%i%i",&l,&r);
| ~~~~~^~~~~~~~~~~~~~
# | 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... |