Submission #636786

#TimeUsernameProblemLanguageResultExecution timeMemory
636786lovrotGap (APIO16_gap)C++11
30 / 100
46 ms1904 KiB
#include "gap.h"
#include <bits/stdc++.h>

#define ll long long

using namespace std;

const ll INF = 1e18;
const int N = 3 * 1e5 + 10;
ll niz[N];

ll findGap(int t, int n){ 
	int minp = 0;
	int maxp = n - 1;
	ll mn = 0, minr;
	ll mx = INF, maxr;

	while(minp <= maxp){ 
		MinMax(mn, mx, &minr, &maxr);
		niz[minp] = minr;
		niz[maxp] = maxr;
		mn = minr + 1;
		mx = maxr - 1; 
		minp++;
		maxp--;
	}

	ll ans = 0;
	for(int i = 0; i < n - 1; i++) ans = max(ans, niz[i + 1] - niz[i]);
	return ans; 
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...