| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 249313 | sahil_k | 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 "gap.h"
#include <iostream>
#include <algorithm>
using namespace std;
long long findGap (int t, long int n) {
if (t == 1) {
long long mn, mx;
long long p_mn = -1, p_mx = 1e18+1;
long long ans = 0;
for (int i=0; i<(n+1)/2; i++) {
MinMax(p_mn+1, p_mx-1, &mn, &mx);
if (i != 0) ans = max(ans, mn-p_mn);
if (i != 0) ans = max(ans, p_mx-mx);
p_mn = mn;
p_mx = mx;
}
ans = max(ans, mx-mn);
return ans;
} else {
return 0;
}
}