Submission #2772303

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <random>
#include <cstdio>
#include <cstring>
#include <cmath>

// for i in f..<t {... : as Swift
#define forin(i, f, t) for(auto i = f; i < t; i++)

using namespace std;
using ll = long long;

int main() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    for (auto i = 0; i < n; i++) {
        cin >> a[i];
        a[i] -= i;
    }
    
    map<ll, ll> sames;
    for (auto i = 0; i < a.size(); i++) {
        auto target = sames.find(a[i]);
        if (target == sames.end()) {
            sames[a[i]] = 0;
        } else {
            sames[a[i]]++;
        }
    }
    
    ll sh = 0;
    ll maxSames = 0;
    for (auto s : sames) {
        if (s.second > maxSames) {
            maxSames = s.second;
            sh = s.first;
        }
    }
    ll sum = 0;
    for (auto j = 0; j < n; j++) {
        sum += abs(a[j] - sh);
    }
    cout << sum << endl;
    
    
}

Submission Info

Judge Result