| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 967727 | 2024-04-22T17:15:37 Z | TAhmed33 | Gap (APIO16_gap) | C++ | 0 ms | 0 KB |
#include <bits/stdc++.h>
#include "grader.cpp"
using namespace std;
typedef long long ll;
const ll inf = 1e18;
vector <ll> a;
ll ans = 0;
pair <ll, ll> ask (ll l, ll r) {
ll mn = l, mx = r;
MinMax(l, r, &mn, &mx);
return {mn, mx};
}
void recurse (ll l, ll r) {
if (l == r) {
return;
}
ll mid = (l + r) / 2;
auto g = ask(l, mid);
if (g.first != -1) recurse(g.first, g.second);
auto h = ask(mid + 1, r);
if (h.first != -1) recurse(h.first, h.second);
if (g.second != -1 && h.first != -1) ans = max(ans, h.first - g.second);
}
ll findGap (int t, int n) {
a.clear(); ans = 0;
auto g = ask(0, inf);
recurse(g.first, g.second);
return ans;
}