hdu 5112 A Curious Matt
来源:互联网 发布:中文域名注册管理办法 编辑:程序博客网 时间:2024/06/07 03:34
A Curious Matt
Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 928 Accepted Submission(s): 484
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.
Source
2014ACM/ICPC亚洲区北京站-重现赛(感谢北师和上交)
求一段时间内,某一段区间最大的平均速度
#include<stdio.h>#include<math.h>#include<algorithm>using namespace std;struct nod{int tim,opt;}a[11000];double sp[11000];bool cmp(nod a,nod b) {return a.tim<b.tim;}bool cmp2(double a,double b){return a>b;}int main(){int t,n,i,j,v=1;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=0;i<n;++i){scanf("%d%d",&a[i].tim,&a[i].opt);}sort(a,a+n,cmp);for(i=1,j=0;i<n;i++,j++){sp[j]=fabs((a[i].opt-a[i-1].opt)*1.0/(a[i].tim-a[i-1].tim));}sort(sp,sp+j,cmp2);printf("Case #%d: %.2lf\n",v++,sp[0]);}return 0;}
0 0
- 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 水
- hdu 5112 A Curious Matt(排序)
- HDU 5112 A Curious Matt(水~)
- 文章标题 HDU 5112- A Curious Matt
- HDU 5112 A Curious Matt (水题)
- A Curious Matt 5112
- hdoj-5112-A Curious Matt
- HDU 5112 A Curious Matt (14北京 排序 水题)
- HDU 5112 2014ICPC北京站现场赛 A Curious Matt
- hdu 5112 A Curious Matt (java,快速输入)
- hdu 5112 A Curious Matt (结构体+cmp函数)
- HDOJ 5112 A Curious Matt 水题
- hdoj 5112 A Curious Matt(水题)
- [hdoj]1003最大子列和
- UVa 1586 Molar Mass
- hdu 2028
- android 数据存储
- hdu 4027 Can you answer these queries?
- hdu 5112 A Curious Matt
- Unity中的Transform Gizmo中的Pivot和Center
- 循环冗余校验(CRC)算法入门引导
- setsockopt()用法(参数详细说明)
- Jedis - 基本建模图
- windows的socket_tcp服务端与 windows的socket_tcp客服端简单通讯
- hdoj.5112 A Curious Matt【sort+暴力】 2015/08/01
- C#导出Excel
- 机试算法讲解: 第52题 动态规划之搬寝室问题