HDU 5078--Osu!【水题】
2015-08-04 11:46
585 查看
Osu!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1242 Accepted Submission(s): 650
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
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; using namespace std; int time[1010]; double x[1010]; double y[1010]; double dis(int a,int b){ return sqrt( (x[a]-x[b]) * (x[a]-x[b]) + (y[a]-y[b]) * (y[a]-y[b]) ); } int main(){ int T; scanf("%d", &T); while(T--){ int n; scanf("%d", &n); for(int i = 0 ; i < n ; ++i) scanf("%d%lf%lf",&time[i], &x[i], &y[i]); double temp = 0; for(int i = 1; i < n ; ++i){ double d = dis(i, i-1) / (time[i] - time[i-1]); if( temp < d ) temp = d; } printf("%.10lf\n",temp); } return 0; }
相关文章推荐
- C++内联函数
- Squares 分类: POJ 2015-08-04 11:46 3人阅读 评论(0) 收藏
- 2.0-iptables详解
- centos6.6_x64升级firefox
- Squid Epoll网络模型
- Qt 常用类(3)—— QString
- 滤镜属性
- JSON与JAVA数据的相互转换
- AngularJs 初学
- Nginx goaccess 安装应用指南
- 使用Spring的jdbcTemplate进一步简化JDBC操作
- 学习笔记:只有一套app设计稿(5s尺寸)切出4和4s尺寸以及安卓系统主流尺寸的图
- 2015年8月4日11:43:00工作内容
- 比特币钱包应用breadwallet源码iOS版
- 博弈知识汇总
- Lua快速排序算法+代码
- mmap 函数
- nyoj 88 汉诺塔(一)【快速幂】
- nginx支持ssl简介
- android中写文件到内部存储中