LA4329-乒乓比赛
来源:互联网 发布:win7如何建立网络连接 编辑:程序博客网 时间:2024/05/05 13:01
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).
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
题意:训练指南上的例题。求1到ai-1有多少个数小于ai和ai+1到an中共有多少个数小与ai;
树状数组,从第一个数开始处理,遇到一个数ai,将C[ai]赋值为1,插入树状数组。
#include <iostream>#include <cstring>using namespace std;long long int a[20005],c[20005],d[20005],s[20005];long long int max1;long long int lowbit(long long int x){ return x&-x;}long long int sum(long long int x){ int ret=0; while(x>0) { ret+=c[x]; x-=lowbit(x); } return ret;}void add(long long int x,int d1){ while(x<=max1) { c[x]+=d1; x+=lowbit(x); }}int main(){ int n,t; max1=-1; cin>>t; while(t--) { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; max1=(max1>a[i])?max1:a[i]; } memset(c,0,sizeof(c)); for(int i=1;i<=n;i++) { s[i]=sum(a[i]); add(a[i],1); } memset(c,0,sizeof(c)); for(int i=n;i>=1;i--) { d[i]=sum(a[i]); add(a[i],1); } long long int cnt=0; for(int i=1;i<=n;i++) { cnt+=(s[i]*(n-i-d[i])+(i-1-s[i])*d[i]); } cout<<cnt<<endl; } return 0;}
0 0
- LA4329-乒乓比赛
- LA4329乒乓比赛_树状数组
- LA4329 乒乓比赛(树状数组)(训练指南)
- LA4329 乒乓 树状数组
- NKOI 3697 乒乓比赛
- NKOJ-3697 乒乓比赛
- NKOJ 3697 乒乓比赛
- 乒乓球队比赛对手关系
- 树状数组BIT-乒乓比赛
- 例题3.7 乒乓比赛 UVa1428
- 乒乓球队比赛分组问题
- LA4329
- LA4329
- LA4329
- 【程序22】两个乒乓球队进行比赛
- 【笔试】18、两个乒乓球队进行比赛
- 树状数组(乒乓比赛,LA 4329)
- LA 4329 Ping pong乒乓比赛【树状数组】
- [每天一个知识点]15-Java语言-字符串连接
- 希尔排序的实现
- 一道极易出错的笔试题
- UIBarButtonItem系统自带的按钮风格
- iOS XMPP Framework 03 - 创建应用程序框架
- LA4329-乒乓比赛
- 辗转相除法
- Spring事务配置的五种方式和spring里面事务的传播属性和事务隔离级别
- NFS不能mount
- 把'^M' 变成换行符号
- Cocos2d-x场景切换我换换换!----之游戏开发《赵云要格斗》(12)
- extjs override grid column sort
- 数据结构 堆排序原理及其实现
- 直接选择排序及交换二个数据的正确实现