제출 #1325154

#제출 시각아이디문제언어결과실행 시간메모리
1325154riafhasan2010Gap (APIO16_gap)C++17
0 / 100
35 ms2340 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

long long findGap(int T, int n) {
  ll mn = -1, mx = 1e18 + 1, ans = 0;
  vector<ll> a;
	for (int i = 1; i <= (n + 1) / 2; i++) {
    if (mn + 1 > mx - 1) break;
    MinMax(mn + 1, mx - 1, &mn, &mx);
    a.push_back(mn);
    a.push_back(mx);
	}
	sort(a.begin(), a.end());
	for (int i = 1; i < a.size(); i++) {
    ans = max(ans, a[i] - a[i - 1]);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...