제출 #1299416

#제출 시각아이디문제언어결과실행 시간메모리
1299416tamzidGap (APIO16_gap)C++20
30 / 100
32 ms3236 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;

long long findGap(int T, int N)
{
	vector<ll> a(N);
	if(T == 1) {
		ll l = 0, r = 1e18;
		int i = 0, j = N - 1;
		while(i <= j) {
			ll mn, mx;
			MinMax(l, r, &mn, &mx);
			a[i] = mn;
			a[j] = mx;
			l = mn + 1;
			r = mx - 1;
			++i;
			--j;
		}
	}
	ll ans = 0;
	for(int i=0;i<N-1;++i)
		ans = max(ans, a[i + 1] - a[i]);
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...