hdu 2492 ping pong 树状数组好题

Ping pong

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

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
   
   
   
   

 

Source

2008 Asia Regional Beijing

 

Recommend

gaojie

 

题意：
有n个人要进行乒乓球比赛每一个人都一个技术值，每个人出现的次序就是
他们住的位置，现在要求进行一场比赛，三个人，裁判的技术值在两个人的
中间，位置也在两个人的中间，问一共可以进行这种比赛多少次。

分析：
采用树状数组，先从左到右计算左边大的个数，左边小的个数，再从右到
做计算右边大和小的个数，然后交叉相乘取和就可以了

记得如果是c++提交 用__int64

 

#include<stdio.h>
#include<string.h>
#define size 100100
int n,c[size],x1[size],x2[size],y1[size],y2[size],a[size];

int Lowbit(int k)
{
	return (k&-k);
}
void update(int pos,int num)
{
	while(pos<size)//重要  是size  而不是<=n
	{
		c[pos]+=num;
		pos+=Lowbit(pos);
	}
}
int sum(int pos)
{
	int s=0;
	while(pos>0)
	{
		s+=c[pos];
		pos-=Lowbit(pos);
	}
	return s;
}



int main()
{
       int i,cas;
	   scanf("%d",&cas);
	   while(cas--)
	   {
		   memset(c,0,sizeof(c));
		   scanf("%d",&n);
		   for(i=1;i<=n;i++) 
		   {
			   scanf("%d",&a[i]);   
			   int k1; 
			   k1=sum(a[i]);
			   x1[i]=k1; //输入的i个数中 有k1个比a[i]小
			   x2[i]=i-1-k1; //输入的i个数中 有k1个比a[i]大
			   update(a[i],1);
		   }
		   memset(c,0,sizeof(c));
		   int j=1;//代表现在输入的数的个数 
		   for(i=n;i>=1;i--,j++) 
		   {
				 int k1;
				 k1=sum(a[i]);
				 y1[i]=k1;//输入a[i]后输入的那些数中有多少个比a[i]小的
				 y2[i]=j-1-k1; //输入a[i]后输入的那些数中有多少个比a[i]大的
				 update(a[i],1);
		   }
		   __int64 ans=0;
		   for(i=1;i<=n;i++)
		   {
			  // printf("x1[%d]=%d x2[%d]=%d y1[%d]=%d  y2[%d]=%d\n",i,x1[i],i,x2[i],i,y1[i],i,y2[i]);
			  ans+=x1[i]*y2[i]+x2[i]*y1[i];
			   // ans+=x1[i]*x2[i];
		   }
		   printf("%I64d\n",ans);
	   }

}

 

 参考  http://gzhu-101majia.iteye.com/blog/1143276