#include "books.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n, crit_l, crit_r, cmp_cnt;
int cmp[1000000], cmp_l[1000000], cmp_r[1000000];
map<pair<int, int>, ll> dp;
void extend(int &l, int &r) {
int ext_l = min(cmp_l[cmp[l]], cmp_l[cmp[r]]);
int ext_r = max(cmp_r[cmp[l]], cmp_r[cmp[r]]);
while (l != ext_l || r != ext_r) {
if (l != ext_l) {
l--;
ext_l = min(ext_l, cmp_l[cmp[l]]);
ext_r = max(ext_r, cmp_r[cmp[l]]);
} else {
r++;
ext_l = min(ext_l, cmp_l[cmp[r]]);
ext_r = max(ext_r, cmp_r[cmp[r]]);
}
}
}
ll compute(int l, int r) {
extend(l, r);
if (dp.count({l, r})) return dp[{l, r}];
ll ans = LLONG_MAX;
if (l != crit_l) ans = min(ans, compute(l - 1, r) + 2);
if (r != crit_r) ans = min(ans, compute(l, r + 1) + 2);
return dp[{l, r}] = ans;
}
ll minimum_walk(vector<int> p, int s) {
n = p.size();
fill(cmp, cmp + n, -1);
cmp_cnt = 0, crit_l = s, crit_r = s;
ll intra = 0;
for (int i = 0; i < n; i++) {
intra += abs(p[i] - i);
if (cmp[i] == -1) {
int curr = i;
cmp_l[cmp_cnt] = cmp_r[cmp_cnt] = i;
do {
cmp[curr] = cmp_cnt;
cmp_r[cmp_cnt] = max(cmp_r[cmp_cnt], curr);
curr = p[curr];
} while (curr != i);
if (i != p[i]) {
crit_l = min(crit_l, cmp_l[cmp_cnt]);
crit_r = max(crit_r, cmp_r[cmp_cnt]);
}
cmp_cnt++;
}
}
dp[{crit_l, crit_r}] = 0;
return intra + compute(s, s);
}
