hdu 5112 A Curious Matt (结构体+cmp函数)
来源:互联网 发布:淘宝evisu 编辑:程序博客网 时间:2024/06/05 11:15
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≤ 10 6), 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.
#include <iostream>#include <stdio.h>#include <stdlib.h>#include <string.h>#include <algorithm>#include <math.h>using namespace std;struct aa{ int t,x; double v;}a[10005];bool cmp(aa a,aa b){ return a.t<b.t;}int main(){ int n,t; scanf("%d",&t); for(int cas=1;cas<=t;cas++) { scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d%d",&a[i].t,&a[i].x); sort(a,a+n,cmp); a[0].v=0;double max=0; for(int i=1;i<n;i++) {a[i].v=fabs((double)(a[i].x-a[i-1].x)/(a[i].t-a[i-1].t)); if(a[i].v>max) max=a[i].v;} printf("Case #%d: %.2lf\n",cas,max); } return 0;}
阅读全文
0 0
- hdu 5112 A Curious Matt (结构体+cmp函数)
- 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,快速输入)
- HDOJ 5112 A Curious Matt 水题
- hdoj 5112 A Curious Matt(水题)
- 使用Spring Boot Actuator、Jolokia和Grafana实现准实时监控
- Android如何解决Gradle编译慢
- SpringCloud实战小贴士:随机端口
- Netflix Zuul与Nginx的性能对比
- 《Spring Cloud微服务实战》开始预售
- hdu 5112 A Curious Matt (结构体+cmp函数)
- 设计模式六大原则例子(一)-- 接口隔离原则(ISP)例子
- 基于Consul的分布式锁实现
- 用ethtool 命令解决Linux 网卡丢包
- ElasticSearch 常用的查询过滤语句
- 基于Consul的分布式信号量实现
- 版权印
- 欢迎使用CSDN-markdown编辑器
- Spring Cloud实战小贴士:Zuul处理Cookie和重定向