CodeForces 1579E2 :Array Optimization by Deque 树状数组 + 离散化

传送门

题意

给你一个数组，然后给一个双端队列，数组从1~n，你每次可以将ai，放到队列后面或前面，问最后的最小逆序对是多少

分析

考虑插入队首和队尾逆序对增加的个数
也就是求序列中大于$a_i$和小于$a_i$的个数
那么可以用树状数组来维护
因为值域比较大
所以需要提前离散化一下

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N];
VI nums;
ll tr[N];
int n;

int find(int x){
    return lower_bound(nums.begin(),nums.end(),x) - nums.begin() + 1;
}

int lowbit(int x){
    return x & -x;
}

ll sum(int x){
    ll res = 0;
    for(int i = x;i;i -= lowbit(i)) res += tr[i];
    return res;
}

void add(int x,ll c){
    for(int i = x;i < N;i += lowbit(i)) tr[i] += c;
}

int main() {
    int T;
    read(T);
    while(T--){
        read(n);
        nums.clear();
        for(int i = 1;i <= n;i++) {
            read(a[i]);
            nums.pb(a[i]);
        }
        sort(all(nums));
        nums.erase(unique(all(nums)),nums.end());
        memset(tr,0,sizeof tr);
        ll ans = 0;
        for(int i = 1;i <= n;i++){
            if(i == 1) add(find(a[i]),1);
            else{
                ll x = sum(find(a[i]) - 1);
                ll y = sum(N- 1) - sum(find(a[i]));
                ans += min(x,y);
                add(find(a[i]),1);
            }
        }
        dl(ans);
    }
    return 0;
}