poj 3928 难度:一般
来源:互联网 发布:淘宝订单系统设计 编辑:程序博客网 时间:2024/05/29 03:32
点击打开链接
Ping pong
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3541 Accepted: 1272
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题意:按顺序有N个乒乓球运动员,每个人有一个对应的ai值,每三个人可以组成比赛,要求是三个人的中间的人(裁判)的ai值也要排中间,问可以组成多少次比赛。
思路:其实很简单,假设我设置第x人裁判,假设裁判前面有ci个人ai值比他小,那就有x-1-ci个人比他大,裁判后面有di个人的ai值比他小,那么有n-x-di个人的ai值比他大,即第x人为裁判共有:ci*(n-x-di)+(x-1-ci)*di场比赛,可用树状数组求每个人的ci和di。
#include<stdio.h>#include<string.h>#define maxn 100001#define low(i) i&(-i)int ci[maxn],di[maxn];int c[maxn];int a[maxn];int sum(int i){int ans=0;while(i>0){ans+=c[i];i-=low(i);}return ans;}void add(int i){while(i<=maxn){c[i]++;i+=low(i);}}int main(){int T;scanf("%d",&T);while(T--){int i,n;scanf("%d",&n);memset(c,0,sizeof(c));for(i=1;i<=n;i++){scanf("%d",&a[i]);ci[i]=sum(a[i]);add(a[i]);}memset(c,0,sizeof(c));for(i=n;i>=1;i--){di[i]=sum(a[i]);add(a[i]);}int t1,t2;long long ans=0;for(i=2;i<n;i++){t1=ci[i]*(n-i-di[i]);t2=(i-1-ci[i])*di[i];ans+=(t1+t2);}printf("%lld\n",ans);}}
阅读全文
0 0
- poj 3928 难度:一般
- poj 3321 难度:一般
- hdu 5700 难度:一般
- hdu 2795 难度:一般
- hdu--1455--DFS(难度一般)
- 百度Android笔试题(一般难度)
- hdu 5723 最小生成树+数学期望 难度:一般
- POJ 1047 没什么难度,注意读懂题。
- POJ 难度及题型题目分类
- poj 2771 有点难度最大独立集
- poj 1451 难度:中等 字典树+搜索
- poj 2891 一般模线性方程
- poj 2891 (一般模线性方程组)
- Codeforces 263 C. Circle of Numbers D. Cycle in Graph (dfs一般难度)
- 【二分图+最大匹配+有难度】poj 2226 Muddy Fields
- poj 百练 2765(基础题)有难度
- 【最长下降子序列+有难度】北大 poj 1836 Alignment
- poj 3694 中等难度的双…
- 冒泡排序
- 07 xml学习笔记
- leetcode169: Majority Element
- MATLAB中获取一个文件夹下所有文件夹的名字
- 简单的JQ横排响应式轮播图
- poj 3928 难度:一般
- MOOC清华《面向对象程序设计》第8章:装饰模式实验
- PullLoadMoreRecyclerView下拉刷新上拉加载+点击事件
- Intellij Idea的编译和调试快捷键
- 动态库、静态库、运行时库、引入库之间的区别
- 数学运算 计算
- 反射:PropertyInfo、FieldInfo和MemberInfo的区别
- matlab set函数
- 第二周项目0-“输出一段话”