Description
给出一个长度为n的序列A,问有多少四元组(a,b,c,d)使得a!=b!=c!=d,1<=a < b<=n,1<=c < d<=n且Aa < Ab,Ac > Ad
Input
多组用例,每组用例首先输入一个整数n表示序列长度,之后n个整数Ai表示该序列,以文件尾结束输入与(1<=n<=50000,0<=Ai<=1e9)
Output
对于每组用例,输出满足条件的四元组个数
Sample Input
4
2 4 1 3
4
1 2 3 4
Sample Output
0
1
Solution
首先做两遍树状数组得到四个值l1[i],l2[i],r1[i],r2[i]分别表示i左边比a[i]小的,i左边比a[i]大的,i右边比a[i]小的,i右边比a[i]大的,先不看a!=b!=c!=d的条件,那么满足1<=a < b<=n,1<=c < d <=n,Aa < Ab,Ac > Ad四个条件的的四元组个数为sum{ l1[i] }*sum{ r1[i] },其中不合法条件有四种
1.b=c,不合法数为l1[i]*r1[i]
2.a=c,不非法数为r1[i]*r2[i]
3.b=d,不合法数为l1[i]*l2[i]
4.a=d,不合法数为l2[i]*r2[i]
故ans=sum{ l1[i] }*sum{ r1[i] }-sum{ l1[i]*r1[i]+r1[i]*r2[i]+l1[i]*l2[i]+l2[i]*r2[i] }
Code
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define maxn 55555
int T,n,h[maxn],l1[maxn],l2[maxn],r1[maxn],r2[maxn];
struct node
{
int val,pos;
bool operator <(const node&b)const
{
if(val==b.val)return pos<b.pos;
return val<b.val;
}
}a[maxn];
struct BIT
{
#define lowbit(x) (x&(-x))
int b[maxn];
void init()
{
memset(b,0,sizeof(b));
}
void update(int x,int v)
{
while(x<=n)
{
b[x]+=v;
x+=lowbit(x);
}
}
int query(int x)
{
int ans=0;
while(x)
{
ans+=b[x];
x-=lowbit(x);
}
return ans;
}
}bit;
void count()
{
ll ans,cnt1=0,cnt2=0;
for(int i=1;i<=n;i++)
cnt1+=l1[i],cnt2+=r1[i];
ans=cnt1*cnt2;
for(int i=1;i<=n;i++)
{
ll temp=l2[i]*l1[i]+r2[i]*r1[i]+l1[i]*r1[i]+l2[i]*r2[i];
ans-=temp;
}
printf("%I64d\n",ans);
}
int main()
{
while(~scanf("%d",&n))
{
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i].val);
a[i].pos=i;
h[i]=a[i].val;
}
sort(h+1,h+n+1);
for(int i=1;i<=n;i++)a[i].val=lower_bound(h+1,h+n+1,a[i].val)-h;
bit.init();
for(int i=1;i<=n;i++)
{
int pos=a[i].pos;
l1[pos]=bit.query(a[i].val-1);
l2[pos]=bit.query(n)-bit.query(a[i].val);
bit.update(a[i].val,1);
}
bit.init();
for(int i=n;i>=1;i--)
{
int pos=a[i].pos;
r1[pos]=bit.query(a[i].val-1);
r2[pos]=bit.query(n)-bit.query(a[i].val);
bit.update(a[i].val,1);
}
count();
}
return 0;
}