#include "gap.h"
#define ll long long
#include <bits/stdc++.h>
using namespace std;
vector<int> a;
void sol(ll l,ll r){
if(l>r) return;
ll mx,mn;
MinMax(l,r,&mn,&mx);
a.push_back(mn);
a.push_back(mx);
l = mn+1; r = mx-1;
ll mid = (l+r)/2;
sol(l,mid);
sol(mid+1,r);
}
long long findGap(int subtask_num, int n){
if(subtask_num==1){
sol(0,1e18);
sort(a.begin(),a.end());
int ans = 0;
for(int i=0; i<a.size()-1; i++) ans = max(ans,a[i+1]-a[i]);
return ans;
}
return -1;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |