HDU 5078 Osu!

好久没有更了，冒个泡，水一题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string.h>

using namespace std;
const double eps=1e-9;

struct point
{
	double x,y;
	int t;
	point() {}
	point(int t,double x,double y):t(t),x(x),y(y) {}	
}p[1010];

double getdist(point a,point b)
{
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))/(a.t-b.t);	
}

double maxnum(double a,double b)
{
	if(a-b>=eps)
		return a;
	return b;
}
int main()
{
	int cas,n;
	scanf("%d",&cas);
	while(cas--)
	{
		scanf("%d",&n);	
		for(int i=0;i<n;i++)
		{
			scanf("%d%lf%lf",&p[i].t,&p[i].x,&p[i].y);	
		}
		double ans=0;
		for(int i=1;i<n;i++)
		{
			ans=maxnum(ans,getdist(p[i],p[i-1]));	
		}
		printf("%.10lf\n",ans);
	}
	return 0;
}