# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027515 | KasymK | 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"
#include "gap.h"
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define ll long long
const int N = 1e5+5;
ll a[N];
ll findGap(int t, int n){
if(t == 1){
ll l = 1, r = 1e18, id = 0, mn, mx, answer = 0;
for(int i = 0; i < (n+1)/2; ++i){
MinMax(l, r, &mn, &mx);
a[id++] = mn;
a[id++] = mx;
l = mn+1, r = mx-1;
}
sort(a, a+n);
for(int i = 0; i < n-1; ++i)
answer = max(answer, a[i+1]-a[i]);
return answer;
}
return answer;
}