hdu 2492 Realtime Status

原创 2015年11月19日 20:23:29

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;
}

好坑,错了好多次。。。。。
版权声明:本文为博主原创文章,未经博主允许不得转载。

hdu 2492(树状数组)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2492 Ping pong Time Limit: 2000/1000 MS (Java/Oth...
  • liusuangeng
  • liusuangeng
  • 2014年09月23日 16:07
  • 652

HDU 2492 (树状数组)

题意:求出数列递增或者递减的三元组个数。 用树状数组维护每个数左边和右边有几个数比自己大/小即可。...
  • morejarphone
  • morejarphone
  • 2016年04月16日 02:24
  • 134

POJ2492(种类并查集)

题目链接:
  • u013790563
  • u013790563
  • 2014年06月12日 15:56
  • 831

HDU 2492 PingPong (树状数组)

问题描述: Problem Description N(3
  • sinat_34336698
  • sinat_34336698
  • 2016年10月09日 17:42
  • 111

hdu1896之优先队列应用

priority_queue
  • xingyeyongheng
  • xingyeyongheng
  • 2013年09月03日 19:11
  • 2102

拥抱Firebase,Firebase之Realtime Database。(含github源码),欢迎关注。

1  T  R E      I •COMIC• D   3 5    O  Fire...
  • mushanps
  • mushanps
  • 2017年06月03日 08:48
  • 1095

HDU 2492 Ping pong(树状数组)

Ping pongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total ...
  • lihao161530340
  • lihao161530340
  • 2017年12月06日 20:35
  • 43

hdu 2492 Ping pong(树状数组)

Ping pong Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
  • u011699990
  • u011699990
  • 2015年10月11日 18:44
  • 237

HDU 2492 Ping pong(树状数组)

传送门: http://acm.hdu.edu.cn/showproblem.php?pid=2492Problem Description N(3
  • changjiale110
  • changjiale110
  • 2017年12月07日 16:31
  • 76

树状数组+逆序数与顺序数——HDU 2492

树状数组+逆序数与顺序数
  • u013351484
  • u013351484
  • 2014年12月23日 14:22
  • 546
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu 2492 Realtime Status
举报原因:
原因补充:

(最多只允许输入30个字)