제출 #943149

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
943149		penguin133	3단 점프 (JOI19_jumps)	C++17	0 / 100	55 ms	43712 KiB

jumps

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, A[500005], S[500005], q;
int ans;
void dnc(int l, int r, int optl, int optr){
	if(l > r)return;
	int mid = (l + r) >> 1;
	int mx = -1e18, opt = max(optl, mid * 2 - n);
	for(int i = max(optl, mid * 2 - n); i <= min(optr, mid - 1); i++){
		if(A[i] + A[mid] + S[mid * 2 - i] > mx){
			mx = A[i] + A[mid] + S[mid * 2 - i];
			opt = i;
		}
	}
	ans = max(ans, mx);
	dnc(l, mid - 1, optl, opt);
	dnc(mid + 1, r, opt, optr);
}

int memo[5005][5005], bru[5005][5005];

struct node{
	int s, e, m, val;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e) >> 1;
		if(s != e)l = new node(s, m), r = new node(m+1, e), val = max(l->val, r->val);
		else val = A[s];
	}
	int qry(int a, int b){
		if(a == s && b == e)return val;
		if(b <= m)return l->qry(a, b);
		if(a > m)return r->qry(a, b);
		return max(l->qry(a, m), r->qry(m+1, b));
	}
}*root;
int P[500005];

void solve(){
	cin >> n;
	for(int i = 1; i <= n; i++)cin >> A[i];
	root = new node(1, n);
	/*
	for(int i = 1; i <= n; i++){
		bru[i][i] = A[i];
		for(int j = i + 1; j <= n; j++)bru[i][j] = max(A[j], bru[i][j - 1]);
	}
	for(int i = 1; i <= n - 2; i++)memo[i][i + 2] = A[i] + A[i + 1] + A[i + 2];
	for(int i = 3; i < n; i++){
		for(int j = 1; j <= n - i; j++){
			memo[j][j + i] = max({memo[j][j + i - 1], memo[j + 1][j + i], A[j + i] + A[j] + bru[j + 1][(i + j + j) / 2]});
		}
	}
	*/
	for(int i = 1; i <= n; i++)P[i] = max(P[i - 1], A[i]);
	S[n] = A[n];
	vector <pi> stuf;
	for(int i = n - 1; i >= 1; i--)S[i] = max(S[i + 1], A[i]), stuf.push_back({A[i], i});
	cin >> q;
	while(q--){
		int l, r; cin >> l >> r;
		//cout << memo[l][r] << '\n';
	}
	sort(stuf.begin(), stuf.end(), greater<>());
	for(int i = 0; i < min(10ll, (int)stuf.size()); i++){
		for(int j = i + 1; j < min(10ll, (int)stuf.size()); j++){
			int tmp = stuf[i].fi + stuf[j].fi;
			int x = stuf[i].se, y = stuf[j].se;
			if(x > y)swap(x, y);
			if(y * 2 - x <= n)ans = max(ans, tmp + S[y * 2 - x]);
			if(x - (y - x) >= 1)ans = max(ans, root->qry(x * 2 - y, x - 1) + tmp);
			if(y - x >= 2)ans = max(ans, tmp + root->qry(x + 1, (x + y) / 2));
		}
	}
	dnc(1, n, 1, n);
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

jumps.cpp:90:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   90 | main(){
      | ^~~~

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