#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }
tcT> int upb(V<T>& a, const T& b) { return int(ub(all(a),b)-bg(a)); }
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = (int)1e9+7; // 998244353;
const int MX = (int)2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ...
return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x))
constexpr int p2(int x) { return 1<<x; }
constexpr int msk2(int x) { return p2(x)-1; }
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; } // set a = max(a,b)
tcTU> T fstTrue(T lo, T hi, U f) {
++hi; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
--lo; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = lo+(hi-lo+1)/2;
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
auto it = t.find(u); assert(it != end(t));
t.erase(it); } // element that doesn't exist from (multi)set
// INPUT
#define tcTUU tcT, class ...U
constexpr int inf = 1e9 + 7;
tcT> void re(complex<T>& c);
tcTU> void re(pair<T,U>& p);
tcT> void re(V<T>& v);
tcT, size_t SZ> void re(AR<T,SZ>& a);
tcT> void re(T& x) { cin >> x; }
void re(double& d) { str t; re(t); d = stod(t); }
void re(long double& d) { str t; re(t); d = stold(t); }
tcTUU> void re(T& t, U&... u) { re(t); re(u...); }
tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
tcT> void re(V<T>& x) { each(a,x) re(a); }
tcT, size_t SZ> void re(AR<T,SZ>& x) { each(a,x) re(a); }
tcT> void rv(int n, V<T>& x) { x.rsz(n); re(x); }
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
// #ifdef LOCAL
// return b ? "true" : "false";
// #else
return ts((int)b);
// #endif
}
tcT> str ts(complex<T> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(V<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
tcTU> str ts(pair<T,U> p);
tcT> str ts(T v) { // containers with begin(), end()
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
tcTU> str ts(pair<T,U> p) {
#ifdef LOCAL
return "("+ts(p.f)+", "+ts(p.s)+")";
#else
return ts(p.f)+" "+ts(p.s);
#endif
}
// OUTPUT
tcT> void pr(T x) { cout << ts(x); }
tcTUU> void pr(const T& t, const U&... u) {
pr(t); pr(u...); }
void ps() { pr("\n"); } // print w/ spaces
tcTUU> void ps(const T& t, const U&... u) {
pr(t); if (sizeof...(u)) pr(" "); ps(u...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
cerr << ts(t); if (sizeof...(u)) cerr << ", ";
DBG(u...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
void setPrec() { cout << fixed << setprecision(15); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void setIO(str s = "") {
unsyncIO(); setPrec();
if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for USACO
}
#define ints(...) int __VA_ARGS__; re(__VA_ARGS__);
struct Wavelet {
Wavelet *left = nullptr, *right = nullptr;
int l, r, mid;
vpi arr;
vi pre;
bool sp = false;
void calcB() {
pre.resize(arr.size() + 1);
FOR(i,1,pre.size()) {
pre[i] = pre[i - 1] + (arr[i - 1].s < mid ? 1 : 0);
}
}
void push() {
if (!sp) {
if (r - l > 1) {
vpi leftInd, rightInd;
for (auto [i, v] : arr) {
if (v < mid) {
leftInd.emplace_back(i,v);
} else
rightInd.emplace_back(i,v);
}
left = new Wavelet(l,mid,leftInd);
right = new Wavelet(mid,r,rightInd);
calcB();
}
sp = true;
}
}
Wavelet(int l, int r, vpi &arr) : arr(arr), l(l), r(r), mid((r + l) / 2) {
}
pi kmin(int a, int b, int k) {
push();
if (r - l <= 1)
return arr[k - 1 + a];
int leftA = pre[a], leftB = pre[b];
int inRight = (b - leftB) - (a - leftA);
if (inRight >= k)
return right->kmin(a - leftA, b - leftB,k);
else
return left->kmin(leftA,leftB,k - inRight);
}
};
int solve(vpi &arr) {
int ans = 0;
F0R(i,arr.size()) {
F0R(j, arr.size()) {
F0R(k, arr.size()) {
if (!(arr[i].f < arr[j].f && arr[j].f < arr[k].f)) continue;
if (arr[k].f - arr[j].f >= arr[j].f - arr[i].f)
ckmax(ans, arr[i].s + arr[j].s + arr[k].s);
}
}
}
return ans;
}
int main() {
// read read read
setIO();
int n; cin >> n;
vi arr(n);
vpi wArr(n);
F0R(i,n) {
cin >> arr[i];
wArr[i] = {i,arr[i]};
}
auto* wave = new Wavelet(0,inf,wArr);
int q; cin >> q;
F0R(i,q) {
int l, r; cin >> l >> r;
l--; // Adjust indexing
vpi kSmallest;
int LOG = log2(r - l) + 1e5;
F0R(j,min(LOG, r - l)) {
kSmallest.push_back(wave->kmin(l,r,j + 1));
}
cout << solve(kSmallest) << "\n";
}
}
Compilation message
jumps.cpp: In member function 'void Wavelet::calcB()':
jumps.cpp:51:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
| ^
jumps.cpp:212:9: note: in expansion of macro 'FOR'
212 | FOR(i,1,pre.size()) {
| ^~~
jumps.cpp: In constructor 'Wavelet::Wavelet(int, int, vpi&)':
jumps.cpp:206:9: warning: 'Wavelet::arr' will be initialized after [-Wreorder]
206 | vpi arr;
| ^~~
jumps.cpp:205:9: warning: 'int Wavelet::l' [-Wreorder]
205 | int l, r, mid;
| ^
jumps.cpp:236:5: warning: when initialized here [-Wreorder]
236 | Wavelet(int l, int r, vpi &arr) : arr(arr), l(l), r(r), mid((r + l) / 2) {
| ^~~~~~~
jumps.cpp: In function 'int solve(vpi&)':
jumps.cpp:51:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
| ^
jumps.cpp:52:18: note: in expansion of macro 'FOR'
52 | #define F0R(i,a) FOR(i,0,a)
| ^~~
jumps.cpp:256:5: note: in expansion of macro 'F0R'
256 | F0R(i,arr.size()) {
| ^~~
jumps.cpp:51:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
| ^
jumps.cpp:52:18: note: in expansion of macro 'FOR'
52 | #define F0R(i,a) FOR(i,0,a)
| ^~~
jumps.cpp:257:9: note: in expansion of macro 'F0R'
257 | F0R(j, arr.size()) {
| ^~~
jumps.cpp:51:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
| ^
jumps.cpp:52:18: note: in expansion of macro 'FOR'
52 | #define F0R(i,a) FOR(i,0,a)
| ^~~
jumps.cpp:258:13: note: in expansion of macro 'F0R'
258 | F0R(k, arr.size()) {
| ^~~
jumps.cpp: In function 'void setIn(str)':
jumps.cpp:194:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
194 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
jumps.cpp: In function 'void setOut(str)':
jumps.cpp:195:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
195 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
15 ms |
992 KB |
Output is correct |
| 3 |
Correct |
12 ms |
976 KB |
Output is correct |
| 4 |
Correct |
11 ms |
856 KB |
Output is correct |
| 5 |
Correct |
12 ms |
952 KB |
Output is correct |
| 6 |
Correct |
12 ms |
952 KB |
Output is correct |
| 7 |
Correct |
14 ms |
604 KB |
Output is correct |
| 8 |
Correct |
12 ms |
600 KB |
Output is correct |
| 9 |
Correct |
17 ms |
604 KB |
Output is correct |
| 10 |
Correct |
11 ms |
792 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
15 ms |
992 KB |
Output is correct |
| 3 |
Correct |
12 ms |
976 KB |
Output is correct |
| 4 |
Correct |
11 ms |
856 KB |
Output is correct |
| 5 |
Correct |
12 ms |
952 KB |
Output is correct |
| 6 |
Correct |
12 ms |
952 KB |
Output is correct |
| 7 |
Correct |
14 ms |
604 KB |
Output is correct |
| 8 |
Correct |
12 ms |
600 KB |
Output is correct |
| 9 |
Correct |
17 ms |
604 KB |
Output is correct |
| 10 |
Correct |
11 ms |
792 KB |
Output is correct |
| 11 |
Execution timed out |
4041 ms |
19548 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
4041 ms |
265900 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
15 ms |
992 KB |
Output is correct |
| 3 |
Correct |
12 ms |
976 KB |
Output is correct |
| 4 |
Correct |
11 ms |
856 KB |
Output is correct |
| 5 |
Correct |
12 ms |
952 KB |
Output is correct |
| 6 |
Correct |
12 ms |
952 KB |
Output is correct |
| 7 |
Correct |
14 ms |
604 KB |
Output is correct |
| 8 |
Correct |
12 ms |
600 KB |
Output is correct |
| 9 |
Correct |
17 ms |
604 KB |
Output is correct |
| 10 |
Correct |
11 ms |
792 KB |
Output is correct |
| 11 |
Execution timed out |
4041 ms |
19548 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
