Submission #2875777

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;

int main() {
    long long N;
    cin >> N;
    long long A[N];
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
        A[i] -= i + 1;
    }

    sort(A, A + N);
    long long b;
    if (N % 2) {
        b = A[N / 2];
    }
    else {
        b = (A[N / 2 - 1] + A[N / 2]) / 2;
    }

    long long ans = 0;
    for (int i = 0; i < N; ++i) {
        ans += abs(A[i] - b);
    }

    cout << ans << endl;
    
    return 0;
}

Submission Info

Judge Result