Submission #1226989

#TimeUsernameProblemLanguageResultExecution timeMemory
1226989abdelhakimGap (APIO16_gap)C++20
0 / 100
12 ms1948 KiB
#include "gap.h"
#include <bits/stdc++.h>
#define ll long long 
using namespace std;
long long findGap(int T, int N)
{
	vector<ll> a(N);
	ll curl = 0;
	ll curr=1e18;
	ll l=0;
	ll r=N-1;
	while(l<=r)
	{
		ll* mn=0; ll* mx=0;
		MinMax(curl,curr,mn,mx);
		// cout << "here"<<endl;
		a[l]=(ll)mn;
		a[r]=(ll)mx;
		curl=(ll)mn+1;
		curr=(ll)mx-1;
		l++;r--;
	}
	ll mxd=0;
	for (int i=1;i<N;i++) 
	{
		mxd=max(mxd,a[i]-a[i-1]);
	}
	return mxd;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...