#include <algorithm>
#include "gap.h"
using ll = long long;
namespace solver_1
{
ll arr[100005];
ll solve(int n)
{
int l = 0, r = n - 1;
while (l <= r)
{
ll pre = l ? arr[l - 1] + 1 : 0;
ll nxt = r + 1 < n ? arr[r + 1] - 1 : 1e18;
if (l == r)
MinMax(pre, nxt, &arr[l++], &arr[n]);
else
MinMax(pre, nxt, &arr[l++], &arr[r--]);
}
ll res = 0;
for (int i = 1; i < n; i++)
res = std::max(res, arr[i] - arr[i - 1]);
return res;
}
}
ll findGap(int T, int N)
{
if (T == 1)
return solver_1::solve(N);
return 0;
}
