Submission #236736

#	Time	Username	Problem	Language	Result	Execution time	Memory
236736		VEGAnn	Krov (COCI17_krov)	C++14	70 / 140	1590 ms	1152 KiB

krov

#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define ft first
#define sd second
using namespace std;
typedef long long ll;
const int N = 100100;
const int oo = int(2e9);
const ll OO = 1e18;
const int md = int(1e9) + 7;
int n;
ll x[N], ans = OO;

ll get(int id, ll ht){
    ll cur = 0;

    for (int i = 0; i < n; i++)
        cur += abs(x[i] - (ht - abs(i - id)));

    return cur;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    for (int i = 0; i < n; i++)
        cin >> x[i];

    for (int i = 0; i < n; i++){
        ll l = max(i + 1, n - i), r = ll(1e9);

        while (l + 5 < r){
            ll md1 = l + (r - l) / 3;
            ll md2 = r - (r - l) / 3;

            if (get(i, md1) < get(i, md2))
                r = md2;
            else l = md1;
        }

        for (ll j = l; j <= r; j++)
            ans = min(ans, get(i, j));
    }

    cout << ans;

    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14