# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464710 | nickmet2004 | Gap (APIO16_gap) | C++11 | 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"
#define ll long long
using namespace std;
ll findGap(int T , int n){
ll ANS = 0;
if(T == 1){
ll x = 0 , y = 1e18 , mn , mx ,k;
for(int i = 1; i <= (n + 1) /2; ++i){
MinMax(x , 1e18 , mn , mx);
if(x) ANS = max(ANS , mn - x + 1);
k = mn;
MinMax(0 , y , mn , mx);
if(y != 1e18) ANS = max(ANS , y - mx + 1);
if(i == (n + 1)/2) ANS = max(ANS , mx - k);
x = mx + 1;
y = mn - 1;
}
}
return ANS;
}