#include "gap.h"
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
using namespace std;
typedef long long llong;
long long a[100010];
long long ans;
set<llong> st;
llong n;
void get(llong l, llong r){
if(ans >= r - l){
return ;
}
llong sz = (r - l + n - 1) / n;
llong last = l;
vector<pair<llong, llong> > vec;
for(llong tl = l; tl <= r; tl += sz + 1){
llong tr = min(tl + sz, r);
llong mn = NULL, mx = NULL;
MinMax(tl, tr, &mn, &mx);
if(mn == -1){
continue;
}
ans = max(ans, mn - last);
vec.push_back({mn, mx});
last = mx;
}
for(int i = 0; i < vec.size(); i++){
get(vec[i].first, vec[i].second);
}
}
long long findGap(int T, int N) {
n = N;
if(T == 1){
int L = 1, R = N;
long long l = 0, r = 1e18;
while(R >= L){
long long mn = NULL, mx = NULL;
MinMax(l, r, &mn, &mx);
a[L++] = mn;
a[R--] = mx;
l = mn + 1;
r = mx - 1;
}
for(int i = 1; i < N; i++){
if(a[i + 1] - a[i] > ans){
ans = a[i + 1] - a[i];
}
}
return ans;
}else{
llong mn = NULL, mx = NULL;
MinMax(1, (llong) 1e18, &mn, &mx);
get(mn, mx);
return ans;
}
return 0;
}
Compilation message
boat.cpp:1:10: fatal error: gap.h: No such file or directory
#include "gap.h"
^~~~~~~
compilation terminated.
