# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
843619 | Elvin_Fritl | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#include "gap.h"
long long findGap(int t, int n)
{
long long mini = 0 , maxi = 1e18 + 1;
vector<long long>v;
int tr = (n+1)/2;
while(tr--)
{
long long mn,mx;
MinMax(mini , maxi , &mn , &mx);
v.push_back(mn);
if(mn != mx)
v.push_back(mx);
mini = mn + 1;
maxi = mx - 1;
}
sort(v.begin() , v.end());
long long res = 0;
for(int i=1;i<n;i++){
res = max(v[i] , v[i-1] , res);
}
return res;
}