关闭

hdu 2492 Realtime Status

186人阅读 评论(0) 收藏 举报
分类:

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);
}
void add(int i,int 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++){
			add(a[i],1);
			left[i]=Sum(a[i]-1);
			left1[i]=Sum(Size)-Sum(a[i]);
		}
		memset(c,0,sizeof(c));
		for(i=N;i>=1;i--){
			add(a[i],1);
			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;
}

好坑,错了好多次。。。。。
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:39376次
    • 积分:1573
    • 等级:
    • 排名:千里之外
    • 原创:120篇
    • 转载:20篇
    • 译文:0篇
    • 评论:1条
    最新评论
    联系人