UVALive - 4329 Ping pong
来源:互联网 发布:淘宝商城招商 编辑:程序博客网 时间:2024/05/21 05:18
Description
N(3N20000) 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(1T20) , 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 ( 1ai100000 , i = 1...N ).
Output
For each test case, output a single line contains an integer, the total number of different games.
Sample Input
13 1 2 3
Sample Output
1
Source
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=20000+10;
const int maxnum=100000+10;
int n;
int a[maxn],b[maxn],temp[maxn];
int c[maxnum];
int lowbit(int x)
{
return x&(-x);
}
int sum(int x)//
{
int ret=0;
while(x>0)
{
ret+=c[x];
x-=lowbit(x);
}
return ret;
}
void add(int x,int d)
{
while(x<=maxnum-1)//x<=n就wa了,因为是对1~maxnum进行枚举,不是对n进行枚举(n<=20000)
{
c[x]+=d;
x+=lowbit(x);
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&temp[i]);
memset(c,0,sizeof(c));
for(int i=0;i<n;i++)
{
add(temp[i],1);
a[i]=sum(temp[i])-1;//设x[c[i]]=1,所以减去一
}
memset(c,0,sizeof(c));
for(int i=n-1;i>=0;i--)//从后向前修改,注意体会
{
add(temp[i],1);
b[i]=sum(temp[i])-1;
}
long long ans=0;
for(int i=1;i<n-1;i++)
ans+=a[i]*(n-(i+1)-b[i])+(i+1-a[i]-1)*b[i];
printf("%lld\n",ans);
}
return 0;
}
- UVALive 4329 Ping pong
- UVALive 4329 Ping pong
- UVALive 4329 Ping pong
- UVALive - 4329 Ping pong
- UVALive 4329 Ping pong
- UVALive-4329-Ping-pong
- UVALive 4329 Ping pong(线段树)
- UVALive - 4329 Ping pong (树状数组)
- uvalive 4329 Ping pong---树状数组
- 4329 - Ping pong uvalive+树状数组
- uvalive 4329 Ping pong 树状数组
- UVALIVE 4329 Ping pong(树状数组)
- uvalive 4329 Ping pong (树状数组)
- UVALive - 4329 Ping pong 二叉索引树
- UVALive 4329--Ping pong+树状数组
- UVALive - 4329 Ping pong 数状数组
- UVALive - 4329 Ping pong (树状数组)
- UVALive 4329 Ping pong(树状数组)
- 关于amp
- android重复调用OnCreate方法的原因
- Codeforces Beta Round #8 E. Beads
- OSX brew install php Segmentation fault: 11
- Eclipse在线安装ADT等Android插件连接不上的解决方案
- UVALive - 4329 Ping pong
- HDU 1524 A Chess Game 【SG函数】
- 对类的理解
- 发来的卡夫卡法规和共和国
- 使用CStdioFile 读写UNICODE文档
- 今天第一次写博客,先不说技术了
- nodejs使用express,crypto配合validator实现用户登录逻辑
- c# ThreadPool 应用实例
- 2014华为机试-在字符串中找出连续最长的数字串