HDU5078 纯粹贴个水题！

# Osu!

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 103 Accepted Submission(s): 69 Special Judge

Problem Description

Osu! is a very popular music game. Basically, it is a game about clicking. Some points will appear on the screen at some time, and you have to click them at a correct time.

Now, you want to write an algorithm to estimate how diffecult a game is. To simplify the things, in a game consisting of N points, point i will occur at time ti at place (xi, yi), and you should click it exactly at ti at (xi, yi). That means you should move your cursor from point i to point i+1. This movement is called a jump, and the difficulty of a jump is just the distance between point i and point i+1 divided by the time between ti and ti+1. And the difficulty of a game is simply the difficulty of the most difficult jump in the game. Now, given a description of a game, please calculate its difficulty.

Input

The first line contains an integer T (T ≤ 10), denoting the number of the test cases.For each test case, the first line contains an integer N (2 ≤ N ≤ 1000) denoting the number of the points in the game. Then N lines follow, the i-th line consisting of 3 space-separated integers, ti(0 ≤ ti < ti+1 ≤ 106), xi, and yi (0 ≤ xi, yi ≤ 106) as mentioned above.

Output

For each test case, output the answer in one line.Your answer will be considered correct if and only if its absolute or relative error is less than 1e-9.

Sample Input

2 5 2 1 9 3 7 2 5 9 0 6 6 3 7 6 0 10 11 35 67 23 2 29 29 58 22 30 67 69 36 56 93 62 42 11 67 73 29 68 19 21 72 37 84 82 24 98

Sample Output

9.2195444573 54.5893762558

Hint

In memory of the best osu! player ever Cookiezi.

Source

2014 Asia AnShan Regional Contest

/* ***
Author :kuangbin
Created Time :2014/10/22 22:59:21
File Name :E:\2014ACM\2014现场赛\鞍山\I.cpp
************************************************ */

#include <stdio.h>

#include <string.h>

#include

#include

#include

#include

#include

#include

#include

#include <math.h>

#include <stdlib.h>

#include <time.h>
using namespace std;
struct Node{
double t,x,y;
void input(){
scanf(“%lf%lf%lf”,&t,&x,&y);
}
double calc(Node b){
return hypot(x-b.x,y-b.y)/(b.t-t);
}
}node[1010];

int main()
{
//freopen(“in.txt”,”r”,stdin);
//freopen(“out.txt”,”w”,stdout);
int T;
int n;
scanf(“%d”,&T);
while(T–){
scanf(“%d”,&n);
for(int i = 0;i < n;i++)node[i].input();
double ans = -1.0;
for(int i = 0;i < n-1;i++)
ans = max(ans,node[i].calc(node[i+1]));
printf(“%.10lf\n”,ans);
}
return 0;
}

------ 本文结束------
• 本文作者： kuangbin
• 本文链接： 481.html
• 版权声明： 本博客所有文章除特别声明外，均采用 CC BY-NC-SA 4.0 许可协议。转载请注明出处！
0%