hdu5512
来源:互联网 发布:网络通信介质 编辑:程序博客网 时间:2024/06/06 22:45
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.
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 t i and x i (0 ≤ t i, x i ≤ 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 t i would be distinct.
232 21 13 430 31 52 0
Case #1: 2.00Case #2: 5.00
In 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.
题意:一个人在跑步,给出其在n个位置的时刻,每两个相邻位置之间这个人速度恒定,忽略加速的时间,问这个人最大速度
数学模型:对xi升序排,更新(x[i]-x[i-1])/(t[i]-t[i-1])的最大值即可
#include <iostream>#include <algorithm>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <string.h>#include <map>#include <set>#include <queue>#include <deque>#include <list>#include <bitset>#include <stack>#include <stdlib.h>#define lowbit(x) (x&-x)//ios::sync_with_stdio(false);typedef long long ll;typedef long long LL;using namespace std;int n;struct data{ double t; double x;}a[10000+5];int cmp(const data &q,const data &w){ return q.t<w.t;}int main(){ int T; cin>>T; int cas = 1; while(T--) { cin>>n; for(int i=0;i<n;i++) scanf("%lf%lf",&a[i].t,&a[i].x); sort(a,a+n,cmp); double ans = 0; for(int i=0;i<n-1;i++) { double tmp = fabs(a[i+1].x-a[i].x)/(a[i+1].t-a[i].t); if(ans<tmp) ans = tmp; } printf("Case #%d: %.2f\n",cas++,ans); } return 0;}
阅读全文
0 0
- hdu5512
- hdu5512
- HDU5512(水题~)
- HDU5512 Pagodas
- hdu5512-Pagodas
- HDU5512 Pagodas
- HDU5512--Pagodas
- HDU5512 Pagodas(博弈)
- HDU5512(Pagodas)
- HDU5512 Pagodas(GCD)
- HDU5512 Pagodas(GCD+水题)
- HDU5512 Pagodas (欧几里得)
- hdu5512 Pagodas 规律题 gcd
- 【hdu5512 规律】Pagodas icpc2015·沈阳
- Pagodas --(hdu5512)2015ACM/ICPC亚洲区沈阳站
- hdu5512 Pagodas(2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) )
- 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)HDU5512 Pagodas
- 【HDU5512 2015沈阳赛区D】【签到题 gcd博弈】Pagodas 取数x+y或x-y
- iOS开发移除子视图控制器
- 关于VS2013中scanf不能使用的原因
- php cURL Unknown SSL protocol error in connection to vendor.tanga.com:443
- Vue-cli proxyTable 解决开发环境的跨域问题(转)
- Java获取客户端IP地址、MAC地址,根据IP获取地理位置信息代码
- hdu5512
- 使用mina框架内存溢出的问题
- 注册页面
- 标题の我也不知道该叫什么
- raw socket in linux
- 1M带宽、1Mbps、1Mb/s 区分
- Source map
- java通过Http get post请求url获取数据
- log4j:WARN Please initialize the log4j system properly解决办法