HDU 6095 Rikka with Competition
来源:互联网 发布:apache ab工具 编辑:程序博客网 时间:2024/06/08 07:11
Rikka with Competition
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 785 Accepted Submission(s): 596
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
Recommend
liuyiding | We have carefully selected several similar problems for you: 6216 6215 6214 6213 6212
水题,模拟一下
My ugly code
#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <iostream>#include <algorithm>using namespace std;const int maxn=2e5+10;int n,k;int a[maxn];int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) scanf("%d",&a[i]); sort(a+1,a+1+n); int ans=1; int last=a[1]; for(int i=2;i<=n;i++){ if(a[i] - last <= k){ ans++; last=a[i]; } else{ ans=1; last=a[i]; } } printf("%d\n",ans); } return 0;}
阅读全文
0 0
- HDU 6095 Rikka with Competition
- HDU 6095 Rikka with Competition
- hdu 6095-Rikka with Competition
- HDU 6095 Rikka with Competition【】
- hdu 6095-Rikka with Competition
- HDU 6095 Rikka with Competition
- 多校5 HDU-6095 Rikka with Competition
- HDU 6095 Rikka with Competition(思维)
- HDU 6095 Rikka with Competition(水~)
- HDOJ 6095-Rikka with Competition
- 刷题——hdu 6095 Rikka with Competition
- 2017多校五 1011题 hdu 6095 Rikka with Competition
- HDU 6095 Rikka with Competition【阅读题】【水题】
- hdu 多校联赛 Rikka with Competition
- Rikka with Competition(HDU 609)
- hdu2639 Rikka with Competition
- HDU6095 Rikka with Competition
- Rikka with Competition
- win10 64位系统 Visual Studio Ultimate 2013 OpenGL配置
- Ubuntu 16.04设置环境变量
- 自定义控件三角绕圆圈
- MySQL数据库安装与配置详解
- HttpClient和HttpURLConnection网络请求数据
- HDU 6095 Rikka with Competition
- 小仙女讲软考(五):系统开发和运行
- 十大算法之一动态规划—解背包问题-C#代码
- 【每日一句shell】获取系统内存大小
- POJ3040
- 首页限时跳转 Handler+SharedPreferences
- C++ MFC / VS2013 之十七(对话框:颜色对话框)
- Error与Exception的区别
- HDOJ 2098 分拆素数和