Submission #3597182

---

Source Code Expand

#include <iostream>
#include <algorithm>
long long int a[200005], b[4], sadness[4];
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;
        m = m + a[i];
    }
    m = m / n;
    b[1] = m - 1;
    b[2] = m;
    b[3] = m + 1;
    for ( int i = 1; i <= 3; i++ )
    {
        for ( int j = 1; j <= n; j++ )
        {
            sadness[i] = sadness[i] + abs( a[j] - b[i] );
        }
    }
    long long int min = sadness[1];
    if ( sadness[2] <= min )
    {
        min = sadness[2];
    }
    if ( sadness[3] <= min )
    {
        min = sadness[3];
    }
    cout << min;
}

Submission Info

Judge Result