#include "books.h"
#define N 1000005
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans = 0;
ll n, maior[N], qtd = 0, ok[N], en;
vector<int> g;
void dfs(ll x, ll &mx)
{
mx = max(mx, maior[x]);
if(ok[x]) return;
ok[x] = 1;
dfs(g[x], mx);
}
ll minimum_walk(vector<int> p, int s)
{
n = p.size();
g = p;
for(ll i = 0; i < n; i++) ans += abs(i - p[i]);
for(int i = 0; i < n; i++) maior[i] = i;
for(ll i = 0; i < n; i++) dfs(i, maior[i]);
for(ll i = n - 1; i >= 0; i--)
{
if(p[i] != i)
{
en = i;
break;
}
}
ll pos = 0, qtd = 0;
while(pos <= en)
{
pos = maior[pos] + 1;
qtd ++;
}
return ans + 2*(qtd - 1);
}
