Submission #502930

#	Time	Username	Problem	Language	Result	Execution time	Memory
502930		amunduzbaev	Triple Jump (JOI19_jumps)	C++14	100 / 100	1298 ms	106564 KiB

jumps

#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define int long long

const int N = 5e5 + 5;

struct ST{
	int tree[N * 4], add[N * 4], p[N * 4];
	void sett(int i, int v, int lx = 0, int rx = N, int x = 1){
		if(lx == rx) { add[x] = v; return; }
		int m = (lx + rx) >> 1;
		if(i <= m) sett(i, v, lx, m, x<<1);
		else sett(i, v, m+1, rx, x<<1|1);
		add[x] = max(add[x<<1], add[x<<1|1]);
	}
	
	void push(int x, int lx, int rx){
		if(lx == rx || !p[x]) return;
		tree[x<<1] = max(tree[x<<1], p[x] + add[x<<1]);
		tree[x<<1|1] = max(tree[x<<1|1], p[x] + add[x<<1|1]);
		p[x<<1] = max(p[x<<1], p[x]), p[x<<1|1] = max(p[x<<1|1], p[x]);
		p[x] = 0; 
	}
	
	void umax(int l, int r, int v, int lx = 0, int rx = N, int x = 1){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			tree[x] = max(tree[x], v + add[x]);
			p[x] = max(p[x], v); return;
		} push(x, lx, rx); int m = (lx + rx) >> 1;
		umax(l, r, v, lx, m, x<<1), umax(l, r, v, m+1, rx, x<<1|1);
		tree[x] = max(tree[x<<1], tree[x<<1|1]);
	}
	
	int get(int l, int r, int lx = 0, int rx = N, int x = 1){
		if(lx > r || rx < l) return 0;
		if(lx >= l && rx <= r) return tree[x];
		push(x, lx, rx);
		int m = (lx + rx) >> 1;
		return max(get(l, r, lx, m, x<<1), get(l, r, m+1, rx, x<<1|1));
	}
}tree;
 
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n;
	vector<int> a(n);
	for(int i=0;i<n;i++) cin>>a[i];
	vector<vector<ar<int, 2>>> qq(n);
	int q; cin>>q;
	for(int i=0;i<q;i++){
		int l, r; cin>>l>>r; l--, r--;
		qq[l].push_back({r, i});
	}
	
	for(int i=0;i<n;i++) tree.sett(i, a[i]);
	vector<int> ss;
	vector<vector<int>> pp(n);
	for(int i=0;i<n;i++){
		while(!ss.empty() && a[ss.back()] < a[i]) ss.pop_back();
		if(!ss.empty()) pp[ss.back()].push_back(i);
		ss.push_back(i);
	} ss.clear();
	for(int i=n-1;~i;i--){
		while(!ss.empty() && a[ss.back()] < a[i]) ss.pop_back();
		if(!ss.empty()) pp[i].push_back(ss.back());
		ss.push_back(i);
	}
	
	vector<int> res(q);
	for(int i=n-1;~i;i--){
		for(auto j : pp[i]){
			if(j + j - i < n) tree.umax(j + j - i, n - 1, a[i] + a[j]);
		}
		
		for(auto x : qq[i]){
			res[x[1]] = tree.get(i, x[0]);
		}
	}
	
	for(int i=0;i<q;i++) cout<<res[i]<<"\n";
}

• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 27 / 27
• Subtask 4: 54 / 54