# Ping pong

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4909    Accepted Submission(s): 1790

Problem Description
N(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment).

Each player has a unique skill rank. To improve their skill rank, they often compete with each other. If two players want to compete, they must choose a referee among other ping pong players and hold the game in the referee's house. For some reason, the contestants can’t choose a referee whose skill rank is higher or lower than both of theirs.

The contestants have to walk to the referee’s house, and because they are lazy, they want to make their total walking distance no more than the distance between their houses. Of course all players live in different houses and the position of their houses are all different. If the referee or any of the two contestants is different, we call two games different. Now is the problem: how many different games can be held in this ping pong street?

Input
The first line of the input contains an integer T(1<=T<=20), indicating the number of test cases, followed by T lines each of which describes a test case.

Every test case consists of N + 1 integers. The first integer is N, the number of players. Then N distinct integers a1, a2 … aN follow, indicating the skill rank of each player, in the order of west to east. (1 <= ai <= 100000, i = 1 … N).

Output
For each test case, output a single line contains an integer, the total number of different games.

Sample Input
1 3 1 2 3

Sample Output
1

#include<iostream>
#include<cstring>
#define Size 100100
using namespace std;
int N,c[Size+10],a[Size+10];
int lowbit(int x){
return x&(-x);
}
while(i<=Size)
{
c[i]+=x;
i+=lowbit(i);
}
}
int Sum(int i){
int sum=0;
while(i>0){
sum+=c[i];
i-=lowbit(i);
}
return sum;
}
int main()
{
int t,i,left[Size+10],right[Size+10],left1[Size+10],right1[Size+10];
long long sum;
cin>>t;
while(t--)
{
cin>>N;
memset(c,0,sizeof(c));
for(i=1;i<=N;i++)
cin>>a[i];
for(i=1;i<=N;i++){
left[i]=Sum(a[i]-1);
left1[i]=Sum(Size)-Sum(a[i]);
}
memset(c,0,sizeof(c));
for(i=N;i>=1;i--){
right[i]=Sum(a[i]-1);
right1[i]=Sum(Size)-Sum(a[i]);
}
sum=0;
for(i=1;i<=N;i++)
sum+=left[i]*right1[i]+left1[i]*right[i];
cout<<sum<<endl;
}
return 0;
}

#### hdu 2492(树状数组)

2014-09-23 16:07:49

#### hdu 2492 ping pong 树状数组好题

2013-06-14 15:24:37

#### hdu2492 数状数组或者线段树

2014-08-04 19:31:38

#### HDU - 2492Ping pong（树状数组|权值线段树）

2017-08-16 14:47:39

#### hdu 2492 Ping pong (线段树)

2014-04-20 23:27:29

#### HDU 3007 Realtime Status 最小圆覆盖

2016-08-13 16:40:29

#### poj2492 - A Bug's Life

2012-08-09 11:26:20

#### HDU2492ping pang （线段树求逆序对）

2017-12-02 17:47:41

#### V6+2C6678调试之小FPGA--S3

2016-07-10 15:29:51

#### OJ常见的Judge Status

2013-02-27 10:33:06

## 不良信息举报

hdu 2492 Realtime Status