洛谷P2717 寒假作业（cdq分治+归并排序求逆序数）

2020.6.13
君子做事得有担当，这个题目我确实不太明白什么意思，只会O(N^2)的朴素解法，看了下题解才发现有逆序数的弟弟顺序数，用归并就过了？？

先去打cf div2，等会再来研究
代码：

#include <bits/stdc++.h>
using namespace std;
#define limit (500000 + 5)//防止溢出
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f
#define lowbit(i) i&(-i)//一步两步
#define EPS 1e-6
#define FASTIO  ios::sync_with_stdio(false);cin.tie(0);
#define ff(a) printf("%d\n",a );
#define pi(a,b) pair<a,b>
#define rep(i, a, b) for(int i = a; i <= b ; ++i)
#define per(i, a, b) for(int i = b ; i >= a ; --i)
#define mint(a,b,c) min(min(a,b), c)
#define MOD 998244353
#define FOPEN freopen("C:\\Users\\tiany\\CLionProjects\\acm_01\\data.txt", "rt", stdin)
typedef long long ll;
typedef unsigned long long ull;
ll read(){
    ll sign = 1, x = 0;char s = getchar();
    while(s > '9' || s < '0' ){if(s == '-')sign = -1;s = getchar();}
    while(s >= '0' && s <= '9'){x = x * 10 + s - '0';s = getchar();}
    return x * sign;
}//快读
void write(ll x){
    if(x < 0) putchar('-'),x = -x;
    if(x / 10) write(x / 10);
    putchar(x % 10 + '0');
}
ll f[limit];
int n,m;
ll tmp[limit];
ll ans;
void merge_sort(int l, int r){
    if(l == r)return;
    int mid = l + (r - l ) / 2;
    merge_sort(l , mid);
    merge_sort(mid + 1, r);
    int pa = l, pb = mid + 1;
    int it = l;
    while (pa <= mid && pb <= r){
        if(f[pa] <= f[pb]){
            tmp[it++] = f[pa++];
            ans += r - pb + 1;
        }else{
            tmp[it++] = f[pb++];
        }
    }
    while (pa <= mid){
        tmp[it++] = f[pa++];
    }
    while (pb <= r){
        tmp[it++] = f[pb++];
    }
    rep(i ,l , r)f[i] = tmp[i];
}
int main() {
#ifdef LOCAL
    FOPEN;
#endif
    n = read(), m = read();
    rep(i ,1, n){
        f[i] = read();
        f[i] -= m;//剪掉
        f[i] = f[i-1] + f[i];
    }
    ans = 0;
    merge_sort(0,n);
    write(ans);
    return 0;
}