제출 #956100

#제출 시각아이디문제언어결과실행 시간메모리
956100thinknoexitGap (APIO16_gap)C++17
13.80 / 100
85 ms2220 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[100100];
int n;
ll mx = 0;
void play(ll l, ll r) {
	if (l >= r) return;
	ll mid = (l + r) / 2;
	ll ql, qr, _l, _r;
	MinMax(l, mid, &_l, &ql);
	MinMax(mid + 1, r, &qr, &_r);
	if (ql == -1 && qr == -1) return;
	if (ql == -1) return play(qr, r);
	if (qr == -1) return play(l, ql);
	if (ql != -1 && qr != -1) {
		mx = max(mx, qr - ql);
		play(_l, ql), play(qr, _r);
	}
}
ll findGap(int T, int N) {
	n = N;
	if (T == 1) {
		a[0] = -1, a[n + 1] = 1e18 + 1;
		for (int i = 1;i <= (n + 1) / 2;i++) {
			MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
		}
		for (int i = 1;i < n;i++) {
			mx = max(mx, a[i + 1] - a[i]);
		}
		return mx;
	}
	play(0, 1e18);
	return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...