| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 635387 | radal | 3단 점프 (JOI19_jumps) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2")
#pragma GCC optimize("unroll-loops,O3")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 1e6+20,mod = 1e9+7,inf = 1e9+10;
inline int mkay(int a,int b){
if (a+b >= mod) return a+b-mod;
if (a+b < 0) return a+b+mod;
return a+b;
}
inline int poww(int a,int k){
if (k < 0) return 0;
int z = 1;
while (k){
if (k&1) z = 1ll*z*a%mod;
a = 1ll*a*a%mod;
k /= 2;
}
return z;
}
int n;
int a[N],l[N],r[N],mx[N][20],lg[N];
int rmq(int l,int r){
int j = lg[r-l];
return max(mx[r-1][j],mx[l+(1 << j)-1][j]);
}
int main(){
ios_base :: sync_with_stdio(0); cin.tie(0);
cin >> n;
lg[1] = 0;
rep(i,2,n+1) lg[i] = 1+lg[i/2];
stack<int> st;
rep(i,0,n){
cin >> a[i];
mx[i][0] = a[i];
while (!st.empty() && a[st.top()] < a[i]) st.pop();
if (st.empty()) l[i] = -1;
else l[i] = st.top();
st.push(i);
}
rep(j,1,20){
rep(i,(1 << j)-1,n){
mx[i][j] = max(mx[i][j-1],mx[i-(1 << (j-1))][j-1]);
}
}
while(!st.empty()) st.pop();
repr(i,n-1,0){
while (!st.empty() && a[st.top()] < a[i]) st.pop();
if (st.empty()) r[i] = n;
else r[i] = st.top();
st.push(i);
}
int q;
cin >> q;
while(q--){
int L,R;
cin >> L >> R;
L--;
int ans = 0,m[5] = {-1,-1,-1,-1,-1};
rep(i,L,R){
rep(j,0,5){
if (a[i] <= m[j]) continue;
repr(k,4,j+1) m[k] = m[k-1];
m[j] = a[i];
}
}
rep(i,L,R){
if (l[i] >= L && 2*i-l[i] < R){
if (a[i] >= m[4] || a[l[i]] >= m[4] || rmq(2*i-l[i],R) >= m[4]) ans = max(ans,a[i]+a[l[i]]+rmq(2*i-l[i],R));
}
if (r[i] < R && 2*r[i]-i < R){
if (a[i] >= m[4] || a[r[i]] >= m[4] || rmq(2*r[i]-i,R) >= m[4]) ans = max(ans,a[i]+a[r[i]]+rmq(2*r[i]-i,R));
}
}
cout << ans << endl;
}
return 0;
}
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2")
#pragma GCC optimize("unroll-loops,O3")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 1e6+20,mod = 1e9+7,inf = 1e9+10;
inline int mkay(int a,int b){
if (a+b >= mod) return a+b-mod;
if (a+b < 0) return a+b+mod;
return a+b;
}
inline int poww(int a,int k){
if (k < 0) return 0;
int z = 1;
while (k){
if (k&1) z = 1ll*z*a%mod;
a = 1ll*a*a%mod;
k /= 2;
}
return z;
}
int n;
int a[N],l[N],r[N],mx[N][20],lg[N];
int rmq(int l,int r){
int j = lg[r-l];
return max(mx[r-1][j],mx[l+(1 << j)-1][j]);
}
int main(){
ios_base :: sync_with_stdio(0); cin.tie(0);
cin >> n;
lg[1] = 0;
rep(i,2,n+1) lg[i] = 1+lg[i/2];
stack<int> st;
rep(i,0,n){
cin >> a[i];
mx[i][0] = a[i];
while (!st.empty() && a[st.top()] < a[i]) st.pop();
if (st.empty()) l[i] = -1;
else l[i] = st.top();
st.push(i);
}
rep(j,1,20){
rep(i,(1 << j)-1,n){
mx[i][j] = max(mx[i][j-1],mx[i-(1 << (j-1))][j-1]);
}
}
while(!st.empty()) st.pop();
repr(i,n-1,0){
while (!st.empty() && a[st.top()] < a[i]) st.pop();
if (st.empty()) r[i] = n;
else r[i] = st.top();
st.push(i);
}
int q;
cin >> q;
while(q--){
int L,R;
cin >> L >> R;
L--;
int ans = 0,m[5] = {-1,-1,-1,-1,-1};
rep(i,L,R){
rep(j,0,5){
if (a[i] <= m[j]) continue;
repr(k,4,j+1) m[k] = m[k-1];
m[j] = a[i];
}
}
rep(i,L,R){
if (l[i] >= L && 2*i-l[i] < R){
if (a[i] >= m[4] || a[l[i]] >= m[4] || rmq(2*i-l[i],R) >= m[4]) ans = max(ans,a[i]+a[l[i]]+rmq(2*i-l[i],R));
}
if (r[i] < R && 2*r[i]-i < R){
if (a[i] >= m[4] || a[r[i]] >= m[4] || rmq(2*r[i]-i,R) >= m[4]) ans = max(ans,a[i]+a[r[i]]+rmq(2*r[i]-i,R));
}
}
cout << ans << endl;
}
return 0;
}