Submission #40874

#TimeUsernameProblemLanguageResultExecution timeMemory
40874gabrielsimoesGap (APIO16_gap)C++14
30 / 100
59 ms2660 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll INF = 1000000000000000000;

ll findGap(int T, int N) {
	assert(T == 1);

	ll v[N];
	int i = 0, k = N-1;
	ll mn = -1, mx = INF+1;
	while (i <= k) {
		MinMax(mn+1, mx-1, &v[i], &v[k]);
		mn = v[i++];
		mx = v[k--];
	}

	ll ans = 0;
	for (int i = 1; i < N; i++) {
		ans = max(ans, v[i] - v[i-1]);
	}

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...