# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1196004 | hackstar | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int findGap(int t,int n){
vector<int>a(n);
int l=0,r=1e18;
int mn,mx;
for(int i=0;i<n/2;i++){
MinMax(l,r,&mn,&mx);
a[i]=l;
a[n-i-1]=r;
l=mn+1;
r=mx-1;
}
int mx=0;
for(int i=0;i<n-1;i++){
int cur=a[i+1]-a[i];
mx=max(mx,cur);
}
return mx;
}