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 "gap.h"
#include <bits/stdc++.h>
long long findGap(int T, int N)
{
long long arr[N];
int x = 0;
long long a, b;
a = 0;
b = 1000000000000000005;
while(true){
long long mn, mx;
MinMax(a,b,&mn,&mx);
//printf("%lld %lld\n",mn,mx);
if(mn == -1) break;
if(mn == mx){
arr[x] = mn;
break;
}
a = mn+1;
b = mx-1;
arr[x] = mn;
arr[N-x-1] = mx;
x++;
}
long long mm = 0;
for(int i = 0;i < N-1;i++){
mm = std::max(mm,arr[i+1]-arr[i]);
}
return mm;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |