#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long
#define pb push_back
#define sz size()
//static void my_assert(int k){
// if (!k) exit(1);
//}
//
//static int subtask_num, N;
//static long long A[100001];
//static long long call_count;
//long long findGap(int, int);
//void MinMax(long long s, long long t, long long *mn, long long *mx) {
// int lo = 1, hi = N, left = N+1, right = 0;
// my_assert(s <= t && mn != NULL && mx != NULL);
// while (lo <= hi){
// int mid = (lo+hi)>>1;
// if (A[mid] >= s) hi = mid - 1, left = mid;
// else lo = mid + 1;
// }
// lo = 1, hi = N;
// while (lo <= hi){
// int mid = (lo+hi)>>1;
// if (A[mid] <= t) lo = mid + 1, right = mid;
// else hi = mid - 1;
// }
// if (left > right) *mn = *mx = -1;
// else{
// *mn = A[left];
// *mx = A[right];
// }
// if (subtask_num == 1) call_count++;
// else if (subtask_num == 2) call_count += right-left+2;
//}
ll findGap(int T, int N) {
vector <ll> v;
ll l = 0, r = 1e18, mn = 100, mx = 100;
if (T == 1) {
while (1) {
if ((int)v.sz == N) break;
MinMax (l, r, &mn, &mx);
ll x = mn, y = mx;
if (x == y) {
v.pb (x);
break;
}
else {
v.pb (x);v.pb (y);
}
l = x + 1;r = y - 1;
}
}
else {
MinMax (l, r, &mn, &mx);
ll gosh = mx - mn - 1;
gosh = (gosh + N - 2) / (N - 1);
v.pb (mn);v.pb (mx);
ll ok = mn, ko = mx;
for (ll i = ok + 1; i <= ko - 1; i += gosh) {
l = i;r = min (gosh + i - 1, ko - 1);
MinMax (l, r, &mn, &mx);
if (mn != -1 and mx != -1) {
v.pb (mn);v.pb (mx);
}
}
}
ll jog = 0;
sort (v.begin(), v.end());
for (int i = 1; i < (int)v.sz; ++i) {
jog = max (jog, v[i] - v[i - 1]);
}
return jog;
}
/*
1 4
2 3 6 8
*/
//int main() {
// freopen ("input.txt", "r", stdin);
// FILE *in = stdin, *out = stdout;
// my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
// my_assert(1 <= subtask_num && subtask_num <= 2);
// my_assert(2 <= N && N <= 100000);
// for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
// for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
// fprintf(out, "%lld\n", findGap(subtask_num, N));
// fprintf(out, "%lld\n", call_count);
//}
