[BZOJ3289] Mato的文件管理 && 莫队算法

由于只能相邻的两个东西交换 所以就跟统计逆序对差不多了 搞个树状数组上去就可以了

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#include<cmath>
#define lowbit(x) ((x) & (-(x)))
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
const int MAXN = 50000;
struct Node {
    int l, r, id, ans;
    bool operator < (const Node &t) const {
        return id < t.id;
    }
} Q[MAXN+10];
int cnt[MAXN+10], A[MAXN+10], block, n, m, L = 1, R;
int T;
int c[MAXN+10], B[MAXN+10];;
void add(int x, int val) {
    for( ; x <= n; x += lowbit(x)) c[x] += val;
}
int query(int x) {
    int ret = 0;
    for( ; x; x -= lowbit(x)) ret += c[x];
    return ret;
}
bool cmp(const Node &a, const Node &b) {
    if(a.l / block == b.l / block) return a.r < b.r;
    return a.l < b.l;
}
int main() {
    SF("%d", &n);
    block = (int)(sqrt(n) + 1e-7);
    for(int i = 1; i <= n; i++) {
        SF("%d", &A[i]); B[i] = A[i];
    }
    sort(B+1, B+1+n);
    int Len = unique(B+1, B+1+n) - (B+1);
    for(int i = 1; i <= n; i++) A[i] = lower_bound(B+1, B+1+Len, A[i]) - B;
    SF("%d", &m);
    for(int i = 1; i <= m; i++) {
        SF("%d%d", &Q[i].l, &Q[i].r); Q[i].id = i;
    }
    sort(Q+1, Q+1+m, cmp);
    for(int i = 1; i <= m; i++) {
        while(R < Q[i].r) R++, add(A[R], 1), T += (R-L+1) - query(A[R]);
        while(R > Q[i].r) add(A[R], -1), T -= (R-L) - query(A[R]), R--;
        while(L < Q[i].l) add(A[L], -1), T -= query(A[L]-1), L++;
        while(L > Q[i].l) L--, add(A[L], 1), T += query(A[L]-1);
        Q[i].ans = T;
    }
    sort(Q+1, Q+1+m);
    for(int i = 1; i <= m; i++) PF("%d\n", Q[i].ans);
}