题目地址
题目大意:给出n个点出现的时间t,及坐标x、y(按照时间顺序),求其最大难度,难度的计算=相邻2点之间的距离差/相邻2点之间的时间差
解题思路:水~
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000+100;
struct Point
{
double t,x,y;
}p[maxn];
double dis(Point a,Point b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int main()
{
int T,n;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i = 0; i < n; i++)
{
scanf("%lf%lf%lf",&p[i].t,&p[i].x,&p[i].y);
}
double maxx = -1;
for(int i = 0; i < n-1; i++)
{
double tmp = dis(p[i],p[i+1])/(p[i+1].t-p[i].t);
maxx = max(maxx,tmp);
}
printf("%.10lf\n",maxx);
}
return 0;
}