#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int L, R, p[N], n, l, r;

int g(int &l, int &r){
    int u = l;
    int v = r;
    int ed = r;
    int st = 1e9;
    int be = r;
    int a = 0;
    while (r <= R){
        ++ r;
        if (r == R + 1) {
            if (st < be){
                -- r;
                break;
            }
            break;
        }
        if (r > ed){
            if (st < be) {
                break;
            }
            a += 2;
            ed = r;
        }
        ed = max(ed, p[r]);
        st = min(st, p[r]);
    }
    r = ed;

    be = l;
    ed = l;
    st = -1;
    int b = 0;
    while (l >= L){
        -- l;
        if (l == L - 1) {
            if (st > be) {
                ++ l;
                break;
            }
            else return a + b;
        }
        if (l < ed){
            if (st > be) break;
            b += 2;
            ed = l;
        }
        ed = min(ed, p[l]);
        st = max(st, p[l]);
    }
    l = ed;

    while (u > l || v < r){
        if (u > l){
            -- u;
            l = min({l, u, p[u]});
            r = max({r, u, p[u]});
        }
        else if (v < r){
            ++ v;
            l = min({l, v, p[v]});
            r = max({r, v, p[v]});
        }
    }

    return min(a, b);
}

long long minimum_walk(vector <int> arr, int s){
    int n = arr.size();
    for (int i = 0; i < n; ++ i) p[i] = arr[i];

    long long ans = 0;
    L = s, R = s;
    for (int i = 0; i < n; ++ i){
        ans += abs(p[i] - i);
        if (p[i] != i){
            L = min(L, i);
            R = max(R, i);
        }
    }

    l = s;
    r = s;
    int st = min(s, p[s]);
    int ed = max(s, p[s]);
    while (l > st || r < ed){
        if (l > st){
            -- l;
            st = min({st, l, p[l]});
            ed = max({ed, l, p[l]});
        }
        else {
            ++ r;
            st = min({st, r, p[r]});
            ed = max({ed, r, p[r]});
        }
    }

    while (L <= l && r <= R) ans += g(l, r);

    return ans;
}
//
//int main(){
//    freopen("books.inp", "r", stdin);
//    freopen("books.out", "w", stdout);
//
//    cin >> n;
//    int s; cin >> s;
//    vector <int> p(n);
//    for (int i = 0; i < n; ++ i) cin >> p[i];
//    cout << minimum_walk(p, s);
//}