제출 #249316

#제출 시각아이디문제언어결과실행 시간메모리
249316sahil_kGap (APIO16_gap)C++14
30 / 100
72 ms1152 KiB
#include "gap.h"
#include <iostream>
#include <algorithm>
using namespace std;
long long findGap (int t, int n) {
	if (t == 1) {
		long long mn, mx;
		MinMax(0, 1e18, &mn, &mx);
		long long p_mn = mn, p_mx = mx;
		long long ans = 0;
		for (int i=1; i<(n+1)/2; i++) {
			MinMax(p_mn+1, p_mx-1, &mn, &mx);
			ans = max(ans, mn-p_mn);
			ans = max(ans, p_mx-mx);
			p_mn = mn;
			p_mx = mx;
		}
		ans = max(ans, mx-mn);
		return ans;
	} else {
		return 0;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...