// #include "rect.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int INF = 2e9 + 69;
struct SegmentTree{
int n;
vector<pair<int, int>> a;
SegmentTree(int _n){
n = _n;
a.resize(n * 2 + 2, {-INF, 0});
}
void update(int i, pair<int, int> v){
i += n; a[i] = v;
while(i > 1){
i >>= 1;
a[i] = max(a[i * 2], a[i * 2 + 1]);
}
}
pair<int, int> get(int l, int r){
l += n; r += n + 1;
pair<int, int> ans = {-INF, 0};
while(l < r){
if (l & 1) maximize(ans, a[l++]);
if (r & 1) maximize(ans, a[--r]);
l >>= 1; r >>= 1;
}
return ans;
}
};
const int NECESSARY = 20;
const int N = 2e5 + 69, LOG_N = 18;
int rmq[LOG_N][N];
int get(int l, int r){
if (l > r) return -INF;
int j = logOf(r - l + 1);
return max(rmq[j][l], rmq[j][r - MASK(j) + 1]);
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
int n; cin >> n;
vector<int> a(n+1);
for(int i = 1; i<=n; ++i) cin >> a[i];
for(int i = 1; i<=n; ++i) rmq[0][i] = a[i];
for(int j = 1; MASK(j) <= n; ++j)
for(int i = 1; i<=n-MASK(j)+1; ++j)
rmq[j][i] = max(rmq[j-1][i], rmq[j-1][i + MASK(j-1)]);
SegmentTree st(n);
for(int i = 1; i<=n; ++i){
st.update(i, {a[i], i});
}
int q; cin >> q;
while(q--){
int l, r; cin >> l >> r;
vector<int> pos;
for(int i = 0; i < min(NECESSARY, r - l + 1); ++i){
pair<int, int> cur = st.get(l, r);
pos.push_back(cur.second);
st.update(cur.second, {-INF, cur.second});
}
ll ans = 0;
for(int i: pos) for(int j: pos) if (j > i){
int dis = j - i;
maximize(ans, a[i] + a[j] + get(max(i - dis, l), i-1));
maximize(ans, a[i] + a[j] + get(j + dis, r));
if (dis > 1){
maximize(ans, a[i] + a[j] + get(i+1, i + dis / 2));
}
}
cout << ans << "\n";
for(int i: pos){
st.update(i, {a[i], i});
}
}
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
600 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
600 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
28 ms |
7004 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
600 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
