hd5078 Osu!

Osu!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 1271    Accepted Submission(s): 664
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 t _i at place (x _i, y _i), and you should click it exactly at t _i at (x _i, y _i). 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 t _i and t _i+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, t _i(0 ≤ t _i < t _i+1 ≤ 10 ⁶), x _i, and y _i (0 ≤ x _i, y _i ≤ 10 ⁶) 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
   
   
   
   

    
    嗯，题目大一就是说求两点之间距离相对时间值，就是说距离除以时间，然后寻找最大值，保留10位小数，结构体
   
   
   
   

    
    
#include<cstdio>
#include<cstring>
#include<math.h>
#include<algorithm>
using namespace std;
struct node
{
	int time;
	double x,y;
}p[1010];
int cmp(node a,node b)
{
	return a.time<b.time;
}
double dis(double x1,double y1,double x2,double y2)
{
	return sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
}
int main()
{
	int t,n;
	double s,max;
	scanf("%d",&t);
	while(t--)
	{
		max=-1;
		scanf("%d",&n);
		for(int i=0;i<n;++i)
			scanf("%d%lf%lf",&p[i].time,&p[i].x,&p[i].y);
		sort(p,p+n,cmp);
		for(int i=1;i<n;++i)
		{
			s=dis(p[i-1].x,p[i-1].y,p[i].x,p[i].y)/(p[i].time-p[i-1].time);
			if(s>max)
				max=s;
		}
		printf("%.10lf\n",max);
	}
	return 0;
}