Codeforces 645B Mischievous Mess Makers 【逆序对】

题目链接：Codeforces 645B Mischievous Mess Makers

题意：先让你贪心构造一个序列，然后找逆序对。

有规律，但我懒。。。

$AC$代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 10;
const int pN = 1e6;// <= 10^7
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
pii a[MAXN];
bool vis[MAXN];
int n, k;
int lowbit(int x) {
    return x & (-x);
}
LL C[MAXN];
void Update(int x, LL d) {
    while(x <= n) {
        C[x] += d;
        x += lowbit(x);
    }
}
LL Sum(int x) {
    LL s = 0;
    while(x > 0) {
        s += C[x];
        x -= lowbit(x);
    }
    return s;
}
bool cmp(pii a, pii b) {
    return a.fi > b.fi;
}
int main()
{
    cin >> n >> k;
    int l = 1, r = n;
    int Min = 1, Max = n;
    CLR(vis, false);
    for(int i = 0; i < min(k, n/2); i++) {
        a[l].fi = Max; a[l].se = l;
        a[r].fi = Min; a[r].se = r;
        vis[Max] = vis[Min] = true;
        Max--; Min++; l++; r--;
    }
    for(int i = 1; i <= n; i++) {
        if(vis[i]) continue;
        a[l].fi = i; a[l].se = l;
        l++;
    }
    sort(a+1, a+n+1, cmp);
    LL ans = 0; CLR(C, 0);
    for(int i = 1; i <= n; i++) {
        LL sum = Sum(a[i].se);
        ans += sum;
        Update(a[i].se, 1LL);
    }
    cout << ans << endl;
    return 0;
}