Codeforces Round 744 (Div. 3) E2. Array Optimization by Deque

Array Optimization by Deque

time limit per test: 2 second memory limit per test: 256 megabytes input: standard input output: standard output

In fact, the problems E1 and E2 do not have much in common. You should probably think of them as two separate problems.

You are given an integer array $a[1\dots n]=[a_1,a_2,\dots ,a_n]$.

Let us consider an empty deque (double-ended queue). A deque is a data structure that supports adding elements to both the beginning and the end. So, if there are elements $[3,4,4]$ currently in the deque, adding an element $1$ to the beginning will produce the sequence $[1,3,4,4]$, and adding the same element to the end will produce $[3,4,4,1]$.

The elements of the array are sequentially added to the initially empty deque, starting with $a_1$ and finishing with $a_n$. Before adding each element to the deque, you may choose whether to add it to the beginning or to the end.

For example, if we consider an array $a=[3,7,5,5]$, one of the possible sequences of actions looks like this:

1.	add $3$ to the beginning of the deque:	deque has a sequence $[3]$ in it;
2.	add $7$ to the end of the deque:	deque has a sequence $[3,7]$ in it;
3.	add $5$ to the end of the deque:	deque has a sequence $[3,7,5]$ in it;
4.	add $5$ to the beginning of the deque:	deque has a sequence $[5,3,7,5]$ in it;

Find the minimal possible number of inversions in the deque after the whole array is processed.

An inversion in sequence $d$ is a pair of indices $(i,j)$ such that $i<j$ and $d_i>d_j$. For example, the array $d=[5,3,7,5]$ has exactly two inversions — $(1,2)$ and $(3,4)$, since $d_1=5>3=d_2$ and $d_3=7>5=d_4$.

Input

The first line contains an integer $t$ ($1\le t\le 1000$) — the number of test cases.

The next $2t$ lines contain descriptions of the test cases.

The first line of each test case description contains an integer $n$ ($1\le n\le 2\cdot 10^5$) — array size. The second line of the description contains $n$ space-separated integers $a_i$ ($-10^9\le a_i\le 10^9$) — elements of the array.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$.

Output

Print $t$ lines, each line containing the answer to the corresponding test case. The answer to a test case should be a single integer — the minimal possible number of inversions in the deque after executing the described algorithm.

Example

$\mathtt{input}$
6 4 3 7 5 5 3 3 2 1 3 3 1 2 4 -1 2 2 -1 4 4 5 1 3 5 1 3 1 3 2
$\mathtt{output}$
2 0 1 0 1 2

Note

One of the ways to get the sequence $[5,3,7,5]$ in the deque, containing only two inversions, from the initial array $[3,7,5,5]$ (the first sample test case) is described in the problem statement.

Also, in this example, you could get the answer of two inversions by simply putting each element of the original array at the end of the deque. In this case, the original sequence $[3,7,5,5]$, also containing exactly two inversions, will be in the deque as-is.

Tutorial

由题意得，每个元素有两种添加方式，要么添加在前面，要么添加在后面，并且放到前面，带来的逆序对数量是是当前数组中比它小的数的个数；放到后面，带来的逆序对数量是当前数组中比它大的数的个数，所以，产生的新逆序对数量只跟前 $k$ 个元素中几个比当前数 $a_i$ 大有关，且每个元素产生的新的逆序对数量是相互独立的，最后答案是 ${\sum }_{i=0}^n(a_i所贡献的逆序对)$，综上所述，对于每个元素 $a_i$，只需要取 $\min (比a_i小的元素个数，比a_i大的元素个数)$​

可以用树状数组来解决这个问题，可以快速查询前可以快速查找区间内的值的个数

此解法时间复杂度为 $\mathcal{O}(n\log n)$

Solution

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define int long long
#define lowbit(x) x & -x

struct Tree {
    vector<int> tree;
    
    Tree() {}
    Tree(int n) {
        tree.resize(n + 11);
    }
    
    void update(int i, int x) {
        while (i < tree.size()) {
            tree[i] += x;
            i += lowbit(i);
        }
    }
    
    int query(int i) {
        int ans = 0;
        while (i) {
            ans += tree[i];
            i -= lowbit(i);
        }
        return ans;
    }
};

void solve() {
    int n, ans = 0;
    cin >> n;
    Tree tree(n);
    vector<int> a(n);
    for (int &ai : a) {
        cin >> ai;
    }
    vector<int> b(a);
    ranges::sort(b);
    b.erase(unique(b.begin(), b.end()), b.end());
    map<int, int> idx;
    for (int i = 0; i < b.size(); ++i) {
        idx[b[i]] = i + 1;
    }
    for (int i = 0; i < n; ++i) {
        ans += min(tree.query(idx[a[i]] - 1), tree.query(n) - tree.query(idx[a[i]]));
        tree.update(idx[a[i]], 1);
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(15);
    int Test; cin >> Test; while (Test--)
    solve();
    return 0;
}