#include <bits/stdc++.h>
using namespace std;
constexpr int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
auto func = [&](int i, int j) {
return a[i] > a[j] ? i : j;
};
const int max_log = __lg(n) + bool(n & (n - 1));
vector<vector<int>> st(max_log);
st[0].resize(n);
iota(st[0].begin(), st[0].end(), 0);
for (int i = 1; i < max_log; ++i) {
st[i].resize(n - (1 << i) + 1);
for (int j = 0; j < (int) st[i].size(); ++j) {
st[i][j] = func(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
vector<int> logn(n + 1);
for (int i = 2; i <= n; ++i) {
logn[i] = logn[i >> 1] + 1;
}
auto query = [&](int l, int r) {
int lg = logn[r - l];
return func(st[lg][l], st[lg][r - (1 << lg)]);
};
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
--l;
vector<int> p;
set<array<int, 3>, greater<>> pq;
pq.insert({a[query(l, r)], l, r});
for (int t = 1; t <= 25 && !pq.empty(); ++t) {
auto [val, L, R] = *pq.begin();
pq.erase(pq.begin());
int i = query(L, R);
p.push_back(i);
if (L < i) {
pq.insert({a[query(L, i)], L, i});
}
if (i + 1 < R) {
pq.insert({a[query(i + 1, R)], i + 1, R});
}
while (pq.size() > 25) pq.erase(prev(pq.end()));
}
int ans = 0;
for (int i: p) {
for (int j: p) {
if (i < j) {
int R = j + (j - i);
if (R < r) {
ans = max(ans, a[i] + a[j] + a[query(R, r)]);
}
int len = j - i - 1;
if (len > 0) {
ans = max(ans, a[i] + a[j] + a[query(i + 1, i + 1 + ((len + 1) / 2))]);
}
int L = max(l, i - (j - i));
if (L < i) {
ans = max(ans, a[i] + a[j] + a[query(L, i)]);
}
}
}
}
cout << ans << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Execution timed out |
4051 ms |
4612 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
25 ms |
14920 KB |
Output is correct |
2 |
Correct |
26 ms |
14932 KB |
Output is correct |
3 |
Correct |
26 ms |
14936 KB |
Output is correct |
4 |
Correct |
34 ms |
14932 KB |
Output is correct |
5 |
Correct |
33 ms |
14944 KB |
Output is correct |
6 |
Incorrect |
22 ms |
14896 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Execution timed out |
4051 ms |
4612 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |