#include "books.h"
#include<bits/stdc++.h>
using namespace std;
#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define s second
#define f first
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 3e5;
ll minimum_walk(vector<int> p, int s) {
int n = sz(p), mx = 0;
vector<int> was(n + 1), h[n];
ll ans = 0;
for (int i = 0; i < n; i++) {
if (was[i] || i == p[i]) continue;
int x = i, mn = n;
while (!was[x]) {
//h[i].push_back(x);
mn = min(mn, x);
was[x] = 1;
ans += abs(p[x] - x);
x = p[x];
}
mx = max(mx, mn);
//sort(all(h[i]));
}
return ans + mx + abs(mx - p[s]) - p[s];
/*int val = N;
for (int x = 0; x < n; x++) {
int mx = 0;
for (int i = 0; i < n; i++) {
if (!sz(h[i])) continue;
int ps = lower_bound(all(h[i]), x) - h[i].begin();
if (ps == sz(h[i])) {
mx = N;
break;
}
mx = max(mx, h[i][ps]);
}
val = min(val, mx - x);
cout << x << ' ' << mx << endl;
}
return ans + val * 2;*/
}
