oj.uz

Submission #944181

# Submission time Handle Problem Language Result Execution time Memory
944181 2024-03-12T09:39:35 Z kxd Triple Jump (JOI19_jumps) C++17
0 / 100
 4000 ms 4720 KB 
#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 2e5+5;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

int a[N], mx[N];

signed main() {
	//INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n;
	cin >> n;
	forn1(i,n) {
		cin >> a[i];
	}
	mx[n] = a[n];
	for(int i = n-1; i >= 1; i--) {
		mx[i]=max(mx[i+1],a[i]);
	}
	int q;
	cin >> q;
	int l, r;
	cin >> l >> r;
	int ans = 0;
	deque<int> dq;
	dq.push_back(1);
	for(int j = 2; j <= r-1; j++) {
		//cout << i << ' ' << j << '|' << j+1 << ' ' << min(r,j+(j-i)) << endl;
		for(auto it = prev(dq.end()); ;it--) {
			int i = *(it);
			int k = mx[j+(j-i)];
			chmax(ans,a[i]+a[j]+k);
			if(k==mx[1]) break;
			if(it==dq.begin()) break;
		}
		while(dq.size()&&a[dq.back()]<=a[j]) dq.pop_back();
		dq.push_back(j);
	}
	cout << ans << endl;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 3412 KB Output is correct
2 Correct 52 ms 3408 KB Output is correct
3 Execution timed out 4049 ms 4720 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -