| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1282112 | haha | Rainforest Jumps (APIO21_jumps) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e6+5;
int n,q;
int a[maxn];
stack<int> st;
vector<int> g[maxn];
queue<int> Q;
int dis[maxn];
void bfs(int u)
{
for(int i=1;i<=n;i++) dis[i]=1e9;
while(!Q.empty()) Q.pop();
Q.push(u);
dis[u]=0;
while(!Q.empty()){
u=Q.front();
Q.pop();
for(int i=0;i<g[u].size();i++){
int v=g[u][i];
if(dis[v]>dis[u]+1){
dis[v]=dis[u]+1;
Q.push(v);
}
}
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>q;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
while(!st.empty()&&a[st.top()]<=a[i]) st.pop();
if(!st.empty()){
g[i].push_back(st.top());
}
st.push(i);
}
for(int i=n-1;i>=0;i--){
while(!st.empty()&&a[st.top()]<=a[i]) st.pop();
if(!st.empty()){
g[i].push_back(st.top());
}
st.push(i);
}
while(q--){
int a,b,c,d;
cin>>a>>b>>c>>d;
int ans=1e9;
for(int i=a;i<=b;i++){
bfs(i);
for(int j=c;j<=d;j++) ans=min(ans,dis[j]);
}
cout<<ans<<'\n';
}
}
