UVA1428 Ping pong

思路

分别统计这个位置左边和右边各有多少大于和小于它的数，乘起来即可
使用权值树状数组

代码

#include <cstdio>
#include <algorithm>
#include <cstring>
#define int long long
using namespace std;
const int MAXN = 100000;
struct BIT{
    int a[MAXN+10];
    int lowbit(int x){
        return x&(-x);
    }
    int query(int x){
        int ans=0;
        while(x){
            ans+=a[x];
            x-=lowbit(x);
        }
        return ans;
    }
    void add(int pos,int x){
        while(pos<=MAXN){
            a[pos]+=x;
            pos+=lowbit(pos);
        }
    }
    void init(void){
        memset(a,0,sizeof(a));
    }
}L,R;
int T,n,a[MAXN],ans=0;
signed main(){
    freopen("test.in","r",stdin);
    freopen("test.out","w",stdout);
    scanf("%lld",&T);
    while(T--){
        ans=0;
        L.init();
        R.init();
        scanf("%lld",&n);
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
            R.add(a[i],1);
        }
        for(int i=1;i<=n;i++){
            R.add(a[i],-1);
            ans+=L.query(a[i]-1)*(R.query(MAXN)-R.query(a[i]-1));
            ans+=R.query(a[i]-1)*(L.query(MAXN)-L.query(a[i]-1));
            L.add(a[i],1);
        }
        printf("%lld\n",ans);
    }
    return 0;
}

转载于:https://www.cnblogs.com/dreagonm/p/10683903.html