#include <bits/stdc++.h> #include "gap.h" using namespace std; using ll = long long; ll findGap(int t, int n){ vector <ll> v; ll curmn=0,curmx=1e18,mn,mx; while (curmn<=curmx){ MinMax(curmn,curmx,&mn,&mx); if (mn!=-1){v.push_back(mn);curmn=mn+1;} if (mx!=-1){v.push_back(mx);curmx=mx-1;} } sort(v.begin(),v.end()); ll ans=0; for (int i=1; i<n; i++){ ans=max(ans,v[i]-v[i-1]); } }

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^