Submission #3597257

---

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, min;
    cin >> n;
    for ( int i = 1; i <= n; i++ )
    {
        cin >> a[i];
        a[i] = a[i] - i;
    }
    if ( n % 2 == 1 )
    {
        m = a[(n+1)/2];
        for ( int i = 1; i <= n; i++ )
        {
            sadness[0] = sadness[0] + abs(a[i] - m);
        }
        cout << sadness[0];
    }
    if ( n % 2 == 0 )
    {
        m = ( a[n/2] + a[n/2+1] ) / 2;
        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]);
            }
            min = sadness[1];
            if ( sadness[i] <= min )
            {
                min = sadness[i];
            }
        }
        cout << min;
    }
}

Submission Info

Judge Result