# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
400690 | fadi57 | Gap (APIO16_gap) | C++14 | 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"
//#include "grader.h"
using namespace std;
typedef long long ll;
long long findGap(int T, int N)
{
ll t,s; ll mn,mx;
mn=0;mx=1e18;
s=mn; t=mx;
ll a[N]; int f=1;int en=N;
while(mn<mx){
if(f>=en){break;}
MinMax( s, t, *mn, *mx)
s=mn+1;
mx=mn-1;
a[f]=mx;
a[en]=mx;
f++;en--;
}
ll ans=0;
for(int i=1;i<n;i++){
ans=max(ans,a[i+1]-a[i]);
}
return ans;
}