Submission #564833

#TimeUsernameProblemLanguageResultExecution timeMemory
564833ljubaGap (APIO16_gap)C++17
0 / 100
53 ms1876 KiB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

long long findGap(int T, int N) //probably again different solution for different test cases :(
{
	if(T == 1) {
		vector<ll> v(N);
		ll mini = -1, maksi = ll(1e18) + 1;

		for(int i = 0; i < N; ++i) {
			++mini, --maksi;
			MinMax(mini, maksi, &mini, &maksi);
			v[i] = mini;
			v[N - i - 1] = maksi;
		}

		ll ans = 0;

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

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