[线段树] LOJ #535. 「LibreOJ Round #6」花火

$Solution$

现将所有数转化为二维平面上的点$(i,h_i)$。
几个性质：

• 交换两个数$(i,j),(i\le j, h_i\gt h_j)$，减少了的逆序对数是矩形$\big((i,h_i),(j,h_j)\big)$中的点的两倍$+1$。
• 反证易得，选定的$i$的左上方没有点，$j$的右下方没有点。设其属于的点集为$L,R$。

问题相当于要找一个包含最多点的矩形。
对于一个点$x$属于的矩形代表的二元组$(i,j)$满足以下条件：

• 设$l\in L$为最小的满足$h_l\gt h_x$的数。
• 设$r\in R$为最大的满足$h_r\lt h_x$的数。
• $i\in[l,x-1],r\in[x+1,r]$

建立新的二维平面，这样又相当于点$x$会对新平面中的矩形$\big((l,r),(x+1,x-1)\big)$中的点$(x,y)$有$1$的贡献。找到权值最大的点$(i,j)$就找到了交换的点对$(i,j)$。
扫描线+线段树即可。
时间复杂度$\mathcal{O}(n\log n)$。

#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> Pairs;

const int N = 303030;

inline char get(void) {
    static char buf[100000], *S = buf, *T = buf;
    if (S == T) {
        T = (S = buf) + fread(buf, 1, 100000, stdin);
        if (S == T) return EOF;
    }
    return *S++;
}
template<typename T>
inline void read(T &x) {
    static char c; x = 0; int sgn = 0;
    for (c = get(); c < '0' || c > '9'; c = get()) if (c == '-') sgn = 1;
    for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
    if (sgn) x = -x;
}

namespace BIT {
    int maxn;
    int c[N];
    inline void init(int n) {
        maxn = n;
        for (int i = 0; i <= n; i++)
            c[i] = 0;
    }
    inline void add(int x, int a) {
        for (; x <= maxn; x += x & -x)
            c[x] += a;
    }
    inline int sum(int x) {
        int sm = 0;
        for (; x; x -= x & -x)
            sm += c[x];
        return sm;
    }
}
namespace segTree {
    int ad[N << 2], mx[N << 2];
    inline void mark(int o, int x) {
        ad[o] += x; mx[o] += x;
    }
    inline void pushDown(int o) {
        if (ad[o]) {
            mark(o << 1, ad[o]);
            mark(o << 1 | 1, ad[o]);
            ad[o] = 0;
        }
    }
    inline void pushUp(int o) {
        mx[o] = max(mx[o << 1], mx[o << 1 | 1]);
    }
    inline void add(int o, int l, int r, int L, int R, int x) {
        if (l >= L && r <= R) return mark(o, x);
        int mid = (l + r) >> 1;
        pushDown(o);
        if (L <= mid) add(o << 1, l, mid, L, R, x);
        if (R > mid) add(o << 1 | 1, mid + 1, r, L, R, x);
        pushUp(o);
    }
    inline int max(int o, int l, int r, int L, int R) {
        if (l >= L && r <= R) return mx[o];
        int mid = (l + r) >> 1, res = 0;
        pushDown(o);
        if (L <= mid) res = ::max(res, max(o << 1, l, mid, L, R));
        if (R > mid) res = ::max(res, max(o << 1 | 1, mid + 1, r, L, R));
        return res;
    }
}

int n, scnt;
long long ans;
int h[N], pre[N], suf[N];
struct seg {
    int y, x1, x2, v;
    seg(int _y = 0, int _x1 = 0, int _x2 = 0, int _v = 0) {
        y = _y; x1 = _x1; x2 = _x2; v = _v;
    }
    inline bool operator <(const seg &b) const {
        return y < b.y;
    }
};
seg s[N << 1];

inline int getL(int p) {
    int l = 1, r = p, mid, pos;
    while (l <= r) {
        mid = (l + r) >> 1;
        if (pre[mid] < h[p]) l = mid + 1;
        else r = (pos = mid) - 1;
    }
    return pos;
}
inline int getR(int p) {
    int l = p, r = n, mid, pos;
    while (l <= r) {
        mid = (l + r) >> 1;
        if (suf[mid] > h[p]) r = mid - 1;
        else l = (pos = mid) + 1;
    }
    return pos;
}

int main(void) {
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    read(n);
    for (int i = 1; i <= n; i++) read(h[i]);
    pre[0] = 0;
    for (int i = 1; i <= n; i++)
        pre[i] = max(pre[i - 1], h[i]);
    suf[n + 1] = n + 1;
    for (int i = n; i >= 1; i--)
        suf[i] = min(suf[i + 1], h[i]);
    for (int x = 1; x <= n; x++) {
        if (pre[x] == h[x] || suf[x] == h[x]) continue;
        int l = getL(x), r = getR(x);
        s[scnt++] = seg(x + 1, l, x - 1, 1);
        s[scnt++] = seg(r + 1, l, x - 1, -1);
    }
    sort(s, s + scnt);
    for (int i = 0; i < scnt; i++) {
        segTree::add(1, 1, n, s[i].x1, s[i].x2, s[i].v);
        ans = max((int)ans, segTree::max(1, 1, n, 1, n));
    }
    ans = -2 * ans; 
    BIT::init(n);
    for (int i = n; i >= 1; i--) {
        ans += BIT::sum(h[i]);
        BIT::add(h[i], 1);
    }
    cout << ans << endl;
    return 0;
}