//#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; //ll mod = 1; constexpr ll mod = 998244353; //constexpr ll mod = 1000000007; const int mod17 = 1000000007; const ll INF = mod * mod; typedef pairP; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; using ld = long double; typedef pair LDP; const ld eps = 1e-10; const ld pi = acosl(-1.0); template void chmin(T& a, T b) { a = min(a, b); } template void chmax(T& a, T b) { a = max(a, b); } template vector vmerge(vector& a, vector& b) { vector res; int ida = 0, idb = 0; while (ida < a.size() || idb < b.size()) { if (idb == b.size()) { res.push_back(a[ida]); ida++; } else if (ida == a.size()) { res.push_back(b[idb]); idb++; } else { if (a[ida] < b[idb]) { res.push_back(a[ida]); ida++; } else { res.push_back(b[idb]); idb++; } } } return res; } template void cinarray(vector& v) { rep(i, v.size())cin >> v[i]; } template void coutarray(vector& v) { rep(i, v.size()) { if (i > 0)cout << " "; cout << v[i]; } cout << "\n"; } ll mod_pow(ll x, ll n, ll m = mod) { if (n < 0) { ll res = mod_pow(x, -n, m); return mod_pow(res, m - 2, m); } if (abs(x) >= m)x %= m; if (x < 0)x += m; //if (x == 0)return 0; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } //mod should be <2^31 struct modint { int n; modint() :n(0) { ; } modint(ll m) { if (m < 0 || mod <= m) { m %= mod; if (m < 0)m += mod; } n = m; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } bool operator<(modint a, modint b) { return a.n < b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } modint operator/=(modint& a, modint b) { a = a / b; return a; } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } modint combP(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[a - b]; } ll gcd(ll a, ll b) { a = abs(a); b = abs(b); if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } template void addv(vector& v, int loc, T val) { if (loc >= v.size())v.resize(loc + 1, 0); v[loc] += val; } /*const int mn = 2000005; bool isp[mn]; vector ps; void init() { fill(isp + 2, isp + mn, true); for (int i = 2; i < mn; i++) { if (!isp[i])continue; ps.push_back(i); for (int j = 2 * i; j < mn; j += i) { isp[j] = false; } } }*/ //[,val) template auto prev_itr(set& st, T val) { auto res = st.lower_bound(val); if (res == st.begin())return st.end(); res--; return res; } //[val,) template auto next_itr(set& st, T val) { auto res = st.lower_bound(val); return res; } using mP = pair; mP operator+(mP a, mP b) { return { a.first + b.first,a.second + b.second }; } mP operator+=(mP& a, mP b) { a = a + b; return a; } mP operator-(mP a, mP b) { return { a.first - b.first,a.second - b.second }; } mP operator-=(mP& a, mP b) { a = a - b; return a; } LP operator+(LP a, LP b) { return { a.first + b.first,a.second + b.second }; } LP operator+=(LP& a, LP b) { a = a + b; return a; } LP operator-(LP a, LP b) { return { a.first - b.first,a.second - b.second }; } LP operator-=(LP& a, LP b) { a = a - b; return a; } mt19937 mt(time(0)); const string drul = "DRUL"; string senw = "SENW"; //DRUL,or SENW //int dx[4] = { 1,0,-1,0 }; //int dy[4] = { 0,1,0,-1 }; //----------------------------------------- const int sz = 30; struct wavelet_matrix { private: vector b[sz]; vector cntone[sz]; vector nex[sz]; vector

le[sz], ri[sz]; vector las; public: void init(vector v) { int n = v.size(); per(i, sz) { vector

v0, v1; rep(j, n) { cntone[i][j + 1] = cntone[i][j]; if (v[j] & (1 << i)) { b[i][j] = true; cntone[i][j + 1]++; v1.push_back({ v[j],j }); } else { b[i][j] = false; v0.push_back({ v[j],j }); } } P pre = { 0,0 }; rep(j, n) { le[i][j] = pre; if (b[i][j])pre.second = j; else pre.first = j; } le[i][n] = pre; pre = { n,n }; per(j, n) { if (b[i][j])pre.second = j; else pre.first = j; ri[i][j] = pre; } v.clear(); rep(j, v0.size()) { nex[i][v0[j].second] = j; v.push_back(v0[j].first); } rep(j, v1.size()) { nex[i][v1[j].second] = j + v0.size(); v.push_back(v1[j].first); } } las = v; } wavelet_matrix(vector v) { int n = v.size(); rep(i, sz) { b[i].resize(n); cntone[i].resize(n + 1); nex[i].resize(n); le[i].resize(n + 1); ri[i].resize(n); } per(i, sz) { vector

v0, v1; rep(j, n) { cntone[i][j + 1] = cntone[i][j]; if (v[j] & (1 << i)) { b[i][j] = true; cntone[i][j + 1]++; v1.push_back({ v[j],j }); } else { b[i][j] = false; v0.push_back({ v[j],j }); } } P pre = { 0,0 }; rep(j, n) { le[i][j] = pre; if (b[i][j])pre.second = j; else pre.first = j; } le[i][n] = pre; pre = { n,n }; per(j, n) { if (b[i][j])pre.second = j; else pre.first = j; ri[i][j] = pre; } v.clear(); rep(j, v0.size()) { nex[i][v0[j].second] = j; v.push_back(v0[j].first); } rep(j, v1.size()) { nex[i][v1[j].second] = j + v0.size(); v.push_back(v1[j].first); } } las = v; } //[l,r) //0-indexed int take_kth(int k, int l, int r) { k++; per(i, sz) { int c = cntone[i][r] - cntone[i][l]; if (r - l - c < k) { k -= r - l - c; l = nex[i][ri[i][l].second]; r = nex[i][le[i][r].second] + 1; } else { l = nex[i][ri[i][l].first]; r = nex[i][le[i][r].first] + 1; } } return las[l]; } //number of >=k in [l,r) int number_upk(int k, int l, int r) { int res = 0; per(i, sz) { if (k & (1 << i)) { l = ri[i][l].second; r = le[i][r].second; if (l > r)break; l = nex[i][l]; r = nex[i][r] + 1; } else { res += cntone[i][r] - cntone[i][l]; l = ri[i][l].first; r = le[i][r].first; if (l > r)break; l = nex[i][l]; r = nex[i][r] + 1; } } if (l < r)res += r - l; return res; } //number of <=k in [l,r) int number_dwk(int k, int l, int r) { int res = 0; per(i, sz) { if (k & (1 << i)) { res += r - l; res -= cntone[i][r] - cntone[i][l]; l = ri[i][l].second; r = le[i][r].second; if (l > r)break; l = nex[i][l]; r = nex[i][r] + 1; } else { l = ri[i][l].first; r = le[i][r].first; if (l > r)break; l = nex[i][l]; r = nex[i][r] + 1; } } if (l < r)res += r - l; return res; } }; void solve() { int n; cin >> n; vector a(n); rep(i, n)cin >> a[i]; sort(all(a)); rep(i, n) { a[i] += n - i; } wavelet_matrix wm(a); auto calc = [&](int l, int r) { int len = r - l + 1; int res = wm.take_kth(len / 2, l, r+1); //cout << "? " << l << " " << r << " " << res << "\n"; return res; }; vector vs; vector ls; rep(i, a.size()) { int cl = i, cr = i; int ad = a[i]; while (vs.size() && vs.back() >= ad) { vs.pop_back(); cl = ls.back(); ls.pop_back(); ad = calc(cl, cr); } vs.push_back(ad); ls.push_back(cl); } ls.push_back(n); //coutarray(ls); ll ans = 0; rep(i, vs.size()) { Rep(j, ls[i], ls[i + 1]) { ans += abs(a[j] - vs[i]); } } cout << ans << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); //init_f(); //init(); //while(true) //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }