uva1428 - Ping pong

链接

https://vjudge.net/problem/UVA-1428

题解

拿权值树状数组维护
算出左边有多少个小于等于(大于等于)它的数字，右边有多少大于等于（小于等于）它的数字
枚举裁判的位置，乘法原理计数就好了

代码

#include <bits/stdc++.h>
#define maxn 100010
#define cl(x) memset(x,0,sizeof(x))
#define lowbit(x) (x&-x)
using namespace std;
typedef long long ll;
ll bit[maxn], a[maxn], l[maxn][2], r[maxn][2], N;
ll read(ll x=0)
{
    ll c, f=1;
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-48;
    return f*x;
}
void bitadd(ll pos, ll v)
{
    for(;pos<maxn;pos+=lowbit(pos))bit[pos]+=v;
}
ll bitsum(ll pos)
{
    ll ans(0);
    for(;pos;pos-=lowbit(pos))ans+=bit[pos];
    return ans;
}
int main()
{
    ll i, j, T=read(), ans;
    while(T--)
    {
        N=read();
        for(i=1;i<=N;i++)
        {
            a[i]=read();
        }
        
        cl(bit), cl(l);
        for(i=1;i<=N;i++)
        {
            l[i][0]=bitsum(a[i]);
            l[i][1]=bitsum(maxn-1)-bitsum(a[i]-1);
            bitadd(a[i],1);
        }
        cl(bit), cl(r);
        for(i=N;i;i--)
        {
            r[i][0]=bitsum(a[i]);
            r[i][1]=bitsum(100000)-bitsum(a[i]-1);
            bitadd(a[i],1);
        }

        ans=0;
        for(ll i=1;i<=N;i++)
        {
            //left != right
            ans += l[i][0] * (N-i-r[i][0]);
            ans += l[i][1] * (N-i-r[i][1]);
            ans += ( (i-1-l[i][0]) + (i-1-l[i][1]) ) * (r[i][0]+r[i][1]-(N-i));
            //left == right
            ans += ( l[i][0]+l[i][1]-(i-1) ) * (r[i][0]+r[i][1]-(N-i));
        }
        printf("%lld\n",ans);
    }
    return 0;
}