Submission #2767678

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define ff first
#define dd second
#define mp make_pair
#define pb push_back
#define pp pair<int,int>
#define N 200007 // check
#define K 13
using namespace std;

int n;

int tab[N];

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin >> n;
    for(int i = 0; i < n; ++i) {
        cin >> tab[i];
        tab[i] -= i+1;
    }

    int best = 1e17;

    sort(tab, tab+n);

    int val = 0;
    int cur = tab[0];
    for(int i = 0; i < n; ++i) {
        val += tab[i]-cur;
    }

    best = val;

    int last = cur;

    for(int i = 0; i < n; ) {
        while(i < n and tab[i] == last)++i;
        if(i == n) break;
        val += (tab[i]-last)*i;
        val -= (n-i)*(tab[i]-last);
        last = tab[i];
        best = min(best, val);
    }
    cout << best << endl;

}

Submission Info

Judge Result