World is Exploding
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 901 Accepted Submission(s): 423
Problem Description
Given a sequence A with length n,count how many quadruple (a,b,c,d) satisfies:
a≠b≠c≠d,1≤a<b≤n,1≤c<d≤n,Aa<Ab,Ac>Ad
.
Input
The input consists of multiple test cases.
Each test case begin with an integer n in a single line.
The next line contains n integers A1,A2⋯An .
1≤n≤50000
0≤Ai≤1e9
Each test case begin with an integer n in a single line.
The next line contains n integers A1,A2⋯An .
1≤n≤50000
0≤Ai≤1e9
Output
For each test case,output a line contains an integer.
Sample Input
4 2 4 1 3 4 1 2 3 4
Sample Output
1 0
Author
ZSTU
Source
题意不说了。
我们的方法就是先统计顺序对和逆序对的个数,相乘就是总共的组合数。
再枚举每个数,减去重复的情况即可。
因为只有大小关系的影响,所以可以先离散化。
代码是队友写的。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
typedef unsigned long long LL;
const int maxn=50000+100;
struct point{
int a;
int r;
bool operator < (const point& th) const
{
return a<th.a;
}
}po[maxn];
int n,mp[maxn],A[maxn];
int C[maxn];
LL cnts[maxn],cntm[maxn],cnths[maxn],cnthm[maxn];
int lowbit(int x){ return x&(-x); }
void add(int x,int d)
{
while(x<maxn){
C[x]+=d;
x+=lowbit(x);
}
}
int sum(int x)
{
int res=0;
while(x>0){
res+=C[x];
x-=lowbit(x);
}
return res;
}
void solve(void)
{
memset(C,0,sizeof(C));
memset(mp,0,sizeof(mp));
memset(cnts,0,sizeof(cnts));
memset(cntm,0,sizeof(cntm));
for(int i=1;i<=n;i++){
scanf("%d",&A[i]);
po[i].a=A[i];
po[i].r=i;
}
int p=1;
sort(po+1,po+n+1);
mp[po[1].r]=p;
for(int i=2;i<=n;i++){
if(po[i].a!=po[i-1].a){
mp[po[i].r]=++p;
}
else{
mp[po[i].r]=p;
}
}
// for(int i=1;i<=n;i++) cout<<mp[i]<<endl;
LL sums=0,summ=0;
for(int i=1;i<=n;i++){
cnts[i]=sum(mp[i]-1);
cntm[i]=i-1-sum(mp[i]);
sums+=cnts[i];
summ+=cntm[i];
add(mp[i],1);
}
memset(C,0,sizeof(C));
for(int i=n;i>=1;i--){
LL tem=sum(mp[i]-1);
cnthm[i]=tem;
cnths[i]=n-i-sum(mp[i]);
// cout<<"hres"<<sum(mp[i])<<endl;
//sums+=cnths[i];
//summ+=cnthm[i];
add(mp[i],1);
}
LL ans=sums*summ;
// for(int i=1;i<=n;i++){
// cout<<cnts[i]<<" "<<cntm[i]<<" "<<cnths[i]<<" "<<cnthm[i]<<endl;
// }
// cout<<sums<<" "<<summ<<endl;
for(int i=1;i<=n;i++){// b==c
ans-=(LL)cnts[i]*(LL)cnthm[i];
}
for(int i=1;i<=n;i++){// a==c
ans-=(LL)cnths[i]*(LL)cnthm[i];
}
for(int i=1;i<=n;i++){// a==d
ans-=(LL)cntm[i]*(LL)cnths[i];
}
for(int i=1;i<=n;i++){// b==d
ans-=(LL)cnts[i]*(LL)cntm[i];
}
printf("%I64u\n",ans);
}
int main()
{
while(scanf("%d",&n)!=EOF){
solve();
}
return 0;
}