hdoj 5112 A Curious Matt(水题)
来源:互联网 发布:i排版软件下载 编辑:程序博客网 时间:2024/06/08 03:00
A Curious Matt
Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 930 Accepted Submission(s): 486
Problem Description
There is a curious man called Matt.
One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt finds it interesting to know the maximal speed Ted may reach. In order to do so, Matt takes records of Ted’s position. Now Matt has a great deal of records. Please help him to find out the maximal speed Ted may reach, assuming Ted moves with a constant speed between two consecutive records.
One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt finds it interesting to know the maximal speed Ted may reach. In order to do so, Matt takes records of Ted’s position. Now Matt has a great deal of records. Please help him to find out the maximal speed Ted may reach, assuming Ted moves with a constant speed between two consecutive records.
Input
The first line contains only one integer T, which indicates the number of test cases.
For each test case, the first line contains an integer N (2 ≤ N ≤ 10000),indicating the number of records.
Each of the following N lines contains two integers ti and xi (0 ≤ ti, xi ≤ 106), indicating the time when this record is taken and Ted’s corresponding position. Note that records may be unsorted by time. It’s guaranteed that all ti would be distinct.
For each test case, the first line contains an integer N (2 ≤ N ≤ 10000),indicating the number of records.
Each of the following N lines contains two integers ti and xi (0 ≤ ti, xi ≤ 106), indicating the time when this record is taken and Ted’s corresponding position. Note that records may be unsorted by time. It’s guaranteed that all ti would be distinct.
Output
For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1), and y is the maximal speed Ted may reach. The result should be rounded to two decimal places.
Sample Input
232 21 13 430 31 52 0
Sample Output
Case #1: 2.00Case #2: 5.00HintIn the first sample, Ted moves from 2 to 4 in 1 time unit. The speed 2/1 is maximal.In the second sample, Ted moves from 5 to 0 in 1 time unit. The speed 5/1 is maximal.
<span style="font-size:18px;">#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<algorithm> using namespace std;#define MAX 10010struct node{ int x; int t;} p[MAX];int cmp(node a,node b){return a.t<b.t;}int main(){ int T,ca=1; scanf("%d",&T); while(T--) { int n; memset(p,0,sizeof(p)); scanf("%d",&n); int i; for(i=0;i<n;i++) scanf("%d%d",&p[i].t,&p[i].x); sort(p,p+n,cmp); double ret=0.0; for(i=1;i<n;i++) { double speed=(abs(p[i].x-p[i-1].x)*1.0)/((p[i].t-p[i-1].t)*1.0); if(speed>ret) ret=speed; } printf("Case #%d: %.2lf\n",ca++,ret);}return 0;}</span>
0 0
- hdoj 5112 A Curious Matt(水题)
- HDOJ 5112 A Curious Matt 水题
- hdoj-5112-A Curious Matt
- hdoj 5112 A Curious Matt 【签到题】
- A Curious Matt 5112
- HDU 5112 A Curious Matt (水题)
- hdu 5112 A Curious Matt(排序)
- HDU 5112 A Curious Matt(水~)
- hdoj.5112 A Curious Matt【sort+暴力】 2015/08/01
- HDU 5112 A Curious Matt
- hdu 5112 A Curious Matt
- hdu 5112 A Curious Matt
- HDU 5112 A Curious Matt
- hdu 5112 A Curious Matt
- HDU 5112 A Curious Matt (14北京 排序 水题)
- hdu 5112 A Curious Matt (java,快速输入)
- 【瞎搞】 HDU 5112 A Curious Matt 水
- 文章标题 HDU 5112- A Curious Matt
- gcc 编译器常用的命令行参数一览
- win10安装程序无法正常启动
- Cardboard虚拟现实开发初步(一)
- CodeForces-546D Soldier and Number Game
- http简介
- hdoj 5112 A Curious Matt(水题)
- ios7 二维码图片生成
- 【Lua】pairs 和 ipairs
- SSD基础知识
- CentOS Linux VPS架设 PPTP VPN 教程
- pyqt 取值
- struts2-spring-plugin.jar的一些感悟
- 编程之美: 第二章 数字之魅 2.3_1寻找发帖超过总帖1/4的水王
- spring MVC的困惑 url-pattern的/和/*有区别