Hdu6095 Rikka with Competition(2017多校第5场)
来源:互联网 发布:长兴法院拍卖淘宝网 编辑:程序博客网 时间:2024/06/05 22:49
Rikka with Competition
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 425 Accepted Submission(s): 350
Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:
A wrestling match will be held tomorrow.n players will take part in it. The i th player’s strength point is ai .
If there is a match between thei th player plays and the j th player, the result will be related to |ai−aj| . If |ai−aj|>K , the player with the higher strength point will win. Otherwise each player will have a chance to win.
The competition rules is a little strange. Each time, the referee will choose two players from all remaining players randomly and hold a match between them. The loser will be be eliminated. Aftern−1 matches, the last player will be the winner.
Now, Yuta shows the numbersn,K and the array a and he wants to know how many players have a chance to win the competition.
It is too difficult for Rikka. Can you help her?
A wrestling match will be held tomorrow.
If there is a match between the
The competition rules is a little strange. Each time, the referee will choose two players from all remaining players randomly and hold a match between them. The loser will be be eliminated. After
Now, Yuta shows the numbers
It is too difficult for Rikka. Can you help her?
Input
The first line contains a number t(1≤t≤100) , the number of the testcases. And there are no more than 2 testcases with n>1000 .
For each testcase, the first line contains two numbersn,K(1≤n≤105,0≤K<109) .
The second line containsn numbers ai(1≤ai≤109) .
For each testcase, the first line contains two numbers
The second line contains
Output
For each testcase, print a single line with a single number -- the answer.
Sample Input
25 31 5 9 6 35 21 5 9 6 3
Sample Output
51
Source
2017 Multi-University Training Contest - Team 5
题目的意思是给出n个数,进行n-1场比赛,每场比赛如果双方值差的绝对值大于k就大的数赢,否则都有可能赢,问最后最多多少人可能赢
思路:先按大小排序,然后判差值是否大于k,第一次大于k之前的数的个数就是答案
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <unordered_map>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int a[100005];int T,n,k;int main(){ for(scanf("%d",&T);T--;) { scanf("%d%d",&n,&k); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); int ans=1; for(int i=n-2;i>=0;i--) { if(a[i+1]-a[i]<=k) ans++; else break; } printf("%d\n",ans); } return 0;}
阅读全文
0 0
- Hdu6095 Rikka with Competition(2017多校第5场)
- HDU6095 Rikka with Competition
- HDU6095-Rikka with Competition
- HDU6095-Rikka with Competition
- HDU6095 Rikka with Competition(水题,2017 HDU多校联赛 第5场)
- hdu6095-思维-Rikka with Competition
- hdu6095 Rikka with Competition 2017多校第五场 贪心+思维
- 【多校联合】(HDU6095)Rikka with Competition
- HDU6095 Rikka with Competition 模拟|签到
- 2017杭电多校第五场11Rikka with Competition
- 2017多校5 1011 Rikka with Competition
- Hdu6090 Rikka with Graph(2017多校第5场)
- Hdu6092 Rikka with Subset(2017多校第5场)
- Hdu6085 Rikka with Candies(2017多校第5场)
- HDU 2017 多校联赛5 1011 Rikka with Competition
- 多校5 HDU-6095 Rikka with Competition
- Rikka with Competition(HDU 609)
- HDU 6095 Rikka with Competition(水~)
- 8.9例题
- 单工、半双工和全双工
- 8.4java基础
- DNS
- 数据结构:图的存储、图的遍历、最小生成树、最短路径、拓扑排序
- Hdu6095 Rikka with Competition(2017多校第5场)
- zookeeper 安装 windows环境
- 1031. 【USACO题库】2.3.3 Zero Sum和为零
- 关于使用Iframe自适应高度
- hdoj-2006
- BOOST库 之 format输出流
- 【多校训练】hdu 6090 Rikka with Graph
- app性能优化
- trajan 算法 离线求lca 超详细讲解~~~~ 保证一看就懂~~~