#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=2e5+9,M=2e18+9,mod=1e9+7;
bool vis[N];
pair<ll,ll>p;
vector<ll>v[N];
ll a[N],n,x,y,z;
queue<pair<ll,ll>>q;
void dfs(ll nd,ll dep,ll A,ll B,ll C,ll D)
{
if(vis[nd])return;
vis[nd]=1;
if(A<=nd && nd<=B)dep=0;
if(C<=nd && nd<=D)
{
if(x==-1)x=dep;
x=min(x,dep);
vis[nd]=0;
return;
}
++dep;
for(auto i:v[nd])
{
//cout<<nd<<' '<<i<<'\n';
dfs(i,dep,A,B,C,D);
}
vis[nd]=0;
}
void init(int m,vector<int>h)
{
n=m;
for(ll i=0;i<n;++i)a[i]=h[i];
for(ll i=0;i<n;++i)
{
for(ll j=i-1;j>=0;--j)
{
if(a[j]>a[i])
{
v[i].push_back(j);
break;
}
}
for(ll j=i+1;j<n;++j)
{
if(a[j]>a[i])
{
v[i].push_back(j);
break;
}
}
}
}
Compilation message
/usr/bin/ld: /tmp/cchundbK.o: in function `main':
stub.cpp:(.text.startup+0x1d1): undefined reference to `minimum_jumps(int, int, int, int)'
collect2: error: ld returned 1 exit status
