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>
#define endl "\n"
using namespace std;
long long findGap(int T, int N)
{
long long a[N+9] , i = 0 , l = 0 , r = N , mn = 0 , mx = 1e18+1 , ans = 0 - 1 ;
while (i<N/2 + (N%2))
{
MinMax (mn + 1 , mx-1 , &mn , &mx);
a[l] = mn ;
a[r] = mx ;
l++;
r--;
}
for (int j=0 ; j<N-1 ; j++)
{
ans = max(a[j+1] - a[j] , ans);
}
cout << ans << endl ;
return 0 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |