Submission #744217

#TimeUsernameProblemLanguageResultExecution timeMemory
744217b00norpGap (APIO16_gap)C++14
30 / 100
45 ms1872 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

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