UVALive - 4329 Ping Pong (树状数组)

本文描述了一道关于乒乓球玩家在一条东西向街道上进行比赛的问题。玩家必须选择一个裁判,且裁判的技能等级不能高于或低于两个参赛者的技能等级。文章提供了一个C++代码解决方案,使用了线段树和差分数组来计算可能的比赛数量。

题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2330
题目描述:
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 rst 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 rst integer is N, the number of players. Then
N distinct integers a 1 ; a 2: : : 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

c++代码:


#include <iostream>
#include <cstring>

using namespace std;

const int maxn=2*1e4+5;
const int INF=1e5+5;

typedef long long LL;

int a[maxn];

int lowbit(int x){
	return x&-x;
 }

LL c[INF],d[INF];
int n;

int sum(LL x,LL e[]) {
    LL cnt=0;
    while(x>0) {
    	cnt+=e[x];x-=lowbit(x);
    	
	}
	return cnt;
}

void add(LL x,LL y,LL e[]) {
	while(x<=INF) {
		//if(x==1)cout <<e[x] <<endl;
		e[x]+=y;x+=lowbit(x);
	}
}


int main() {
	int T;
	cin >> T;
	while(T--) {
	  memset(d,0,sizeof(d));
	  memset(c,0,sizeof(c));
	  cin >> n;
	   for(int i=1;i<=n;i++) {
		     cin >> a[i];
		     if(i>1)
		     add(a[i],1,d);
	   }
	   LL ans=0;
	   add(a[1],1,c);
	   for(int i=2;i<=n-1;i++) {
	   	     add(a[i],1,c);//记录左边比a[i]小的数的个数
             LL l=sum(a[i]-1,c);
			 LL r=sum(a[i]-1,d);
			 add(a[i],-1,d);
			 //cout << a[i]-1<<" "<<l <<" " << r <<endl;
			 ans+=l*(n-i-r)+r*(i-1-l);	     
	   }
	   cout << ans << endl;
	}	
	return 0;
}

乐播投屏是一款简单好用、功能强大的专业投屏软件,支持手机投屏电视、手机投电脑、电脑投电视等多种投屏方式。 多端兼容与跨网投屏:支持手机、平板、电脑等多种设备之间的自由组合投屏,且无需连接 WiFi,通过跨屏技术打破网络限制,扫一扫即可投屏。 广泛的应用支持:支持 10000+APP 投屏,包括综合视频、网盘与浏览器、美韩剧、斗鱼、虎牙等直播平台,还能将央视、湖南卫视等各大卫视的直播内容一键投屏。 高清流畅投屏体验:腾讯独家智能音画调校技术,支持 4K 高清画质、240Hz 超高帧率,低延迟不卡顿,能为用户提供更高清、流畅的视觉享受。 会议办公功能强大:拥有全球唯一的 “超级投屏空间”,扫码即投,无需安装。支持多人共享投屏、远程协作批注,PPT、Excel、视频等文件都能流畅展示,还具备企业级安全加密,保障会议资料不泄露。 多人互动功能:支持多人投屏,邀请好友加入投屏互动,远程也可加入。同时具备一屏多显、语音互动功能,支持多人连麦,实时语音交流。 文件支持全面:支持 PPT、PDF、Word、Excel 等办公文件,以及视频、图片等多种类型文件的投屏,还支持网盘直投,无需下载和转格式。 特色功能丰富:投屏时可同步录制投屏画面,部分版本还支持通过触控屏或电视端外接鼠标反控电脑,以及在投屏过程中用画笔实时标注等功能。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值