【codeforces 749E】 Inversions After Shuffle

原题解:https://www.cnblogs.com/MashiroSky/p/6246624.html

#include <iostream>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <sstream>
#include <queue>
#include <map>
#include <functional>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>

using namespace std;
#define pb push_back
#define mk make_pair
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define fst first
#define scd second
#define mid ((l+r)/2)
#define ALL(A) A.begin(), A.end()
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repr(i, n) for(int (i)=(int)(n);(i)>=0;(i)--)
#define repab(i,a,b) for(int (i)=(int)(a);(i)<=(int)(b);(i)++)
#define reprab(i,a,b) for(int (i)=(int)(a);(i)>=(int)(b);(i)--)
#define sc(x) scanf("%d", &x)
#define pr(x) printf("x:%d\n", x)
#define fastio ios::sync_with_stdio(0), cin.tie(0)
#define frein freopen("in.txt", "r", stdin)
#define freout freopen("out.txt", "w", stdout)
#define freout1 freopen("out1.txt", "w", stdout)
#define lson (rt*2+1)
#define rson (rt*2+2)
#define lb puts("")
#define PI M_PI
#define debug cout<<"???"<<endl

const ll mod = 1e9+7;
const int INF = 2e9+5;
//int INF = 0x3f3f3f3f;
const double eps = 1e-6;
template<class T> T gcd(T a, T b){if(!b)return a;return gcd(b,a%b);}

const int maxn = 1e5+100;
int n, a[maxn];
ll bit[maxn];

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

ll query(int x)
{
    ll res = 0;
    while(x > 0){
        res += bit[x];
        x -= lowbit(x);
    }
    return res;
}

void add(int x, int v)
{
    while(x <= n){
        bit[x] += v;
        x += lowbit(x);
        //printf("n:%d, x:%d\n",n,x);
    }
}


void init()
{
    memset(bit, 0, sizeof(bit));
}
int main()
{
    sc(n);
    for(int i = 1; i <= n; i++){
        sc(a[i]);
    }
    init();
    double ans = 0;
    for(int i = 1; i <= n; i++){
        ans += 1.0*(1LL*i*(n-i)*(n-i+1))/2/n/(n+1);
    }
    for(int i = n; i >= 1; i--){
        //printf("a[%d]-1:%d\n",i,a[i]-1);
        ll k = query(a[i]-1);
        ans += 1.0*(k*(1LL*n*(n+1) - 2.0*i*(n+1))/n/(n+1));
        add(a[i],1);
    }
    memset(bit, 0, sizeof(bit));
    for(int i = n; i >= 1; i--){
        ll k = query(a[i]-1);
        ans += 1.0*(2*k*i)/n/(n+1);
        add(a[i],i);
    }

    printf("%.12f\n", ans);
    return 0;
}