# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101361 | shafinalam | 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"
using namespace std;
typedef long long ll;
const int lim = 1e5+5;
#define sf scanf
#define pf printf
#define inf 1e18
ll arr[lim];
ll findGap(int T, int N)
{
ll s = 0, t = inf, mn, mx;
ll l = 1, r = N;
while(l<=r)
{
MinMax(s, t, mn, mx);
arr[l++] = mn;
arr[r--] = mx;
mn++;
mx--;
}
ll ans = -inf;
for(int i = 2; i <= N; i++) max(ans, arr[i]-arr[i-1]);
return ans;
}