This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 2> a2;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int n, a[N];
ll calc(ll x, int pos)
{
if (x - pos <= 0) return 1e18;
ll sum = 0;
for (int i = 0; i < pos; i++) sum += abs(a[i] - (x - abs(pos - i)));
for (int i = pos + 1; i < n; i++) sum += abs(a[i] - (x - abs(pos - i)));
return sum + abs(x - a[pos]);
}
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
ll ans = 1e18, pos;
for (int i = 0; i <= 0; i++)
{
int l = 0, r = 1e9;
while (l + 10 < r)
{
int mdl = l + (r - l) / 3;
int mdr = r - (r - l) / 3;
if (calc(mdl, i) > calc(mdr, i)) l = mdl; else r = mdr;
}
for (int x = l; x <= r; x++)
{
ll val = calc(x, i);
if (ans > val) {ans = val; pos = x;}
}
}
for (int i = 1; i < n; i++)
{
for (int x = pos - 1; x <= pos + 1; x++)
{
ll val = calc(x, i);
if (ans > val) {ans = val; pos = x;}
}
}
cout << ans;
}
Compilation message (stderr)
krov.cpp: In function 'int main()':
krov.cpp:81:40: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
for (int x = pos - 1; x <= pos + 1; x++)
~~~~^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |