#include "books.h"
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
typedef tuple<int,vector<int>,int> trio;
long long minimum_walk(std::vector<int> p, int s){
int n=sz(p);
int r=-1,nf=0,nv=0,ans=0;
ordered_set st;
fall(i,0,n-1){
if(r>=i) continue;
r=i;
int j=i;
while(j<=r){
r=max(r,p[j]);
j++;
}
if(r==i){
nf++;
if(i) nv++;
continue;
}
ans+=nf+nv; nf=nv=0;
st.clear();
fall(j,i,r-1){
st.insert(p[j]);
int vai=sz(st)-st.order_of_key(j+1); ans+=vai;
}
st.clear();
rfall(j,r,i+1){
st.insert(p[j]);
ans+=st.order_of_key(j);
}
nv++;
if(i!=0) ans++;
}
return ans;
}
