Submission #3597286

---

Source Code Expand

#include <iostream>
#include <algorithm>
long long int a[200005], b[4], sadness;
using namespace std;
int main()
{
    long long int n, m = 0;
    cin >> n;
    for ( int i = 1; i <= n; i++ )
    {
        cin >> a[i];
        a[i] = a[i] - i;
    }
    sort(a+1, a+1+n);
    if ( n % 2 == 1 )
    {
        m = a[(n+1)/2];
    }
    else
    {
        m = a[n/2];
    }
    for ( int i = 1; i <= n; i++ )
    {
        sadness = sadness + abs(a[i] - m);
    }
    cout << sadness;
}

Submission Info

Judge Result