Submission #1341060

#TimeUsernameProblemLanguageResultExecution timeMemory
1341060kawhietGap (APIO16_gap)C++20
30 / 100
39 ms1956 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;

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