#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
// #include "gap.h"
// 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;
using namespace std;
#define ff first;
#define ss second
#define pb push_back
//#define int long long
// 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;
// }
long long findGap(int sub,int n){
if(sub==2){
long long l,r,last,mi,mx,sum,i,k;
MinMax(1,1e18,&l,&r);
k=sum=(r-l+n-2)/(n-1);
// cout<<k<<endl;
last=l;
for(i=l;i+k<r;i+=(k+1)){
MinMax(i,i+k,&mi,&mx);
if(mi!=-1 and mx!=-1){
sum=max(sum,mi-last);
last=mx;
}
// i++;
}
MinMax(i,r,&mi,&mx);
if(mi!=-1 and mx!=-1){
sum=max(sum,mi-last);
}
return sum;
}else{
long long a[200005],tl,tr,l,r,mx;
mx=0;
l=1;
r=n;
tl=0;
tr=1e18;
while(l<=r){
MinMax(tl,tr,&a[l],&a[r]);
tl=a[l]+1;
tr=a[r]-1;
l++;
r--;
}
for(int i=2;i<=n;i++){
mx=max(mx,a[i]-a[i-1]);
}
return mx;
}
}
// int main()
// {
// cin>>N>>subtask_num;
// for (int i=1;i<=N;i++) cin>>A[i];
// printf("%lld\n", findGap(subtask_num, N));
// printf("%lld\n", call_count);
// }
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:50:9: error: 'MinMax' was not declared in this scope
50 | MinMax(1,1e18,&l,&r);
| ^~~~~~
gap.cpp:75:13: error: 'MinMax' was not declared in this scope
75 | MinMax(tl,tr,&a[l],&a[r]);
| ^~~~~~