HDU 5935 Car(思维,模拟,精度)
来源:互联网 发布:网络平台建设方案 编辑:程序博客网 时间:2024/06/01 10:03
Car
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 523 Accepted Submission(s): 185
Problem Description
Ruins is driving a car to participating in a programming contest. As on a very tight schedule, he will drive the car without any slow down, so the speed of the car is non-decrease real number.
Of course, his speeding caught the attention of the traffic police. Police recordN positions of Ruins without time mark, the only thing they know is every position is recorded at an integer time point and Ruins started at0 .
Now they want to know the minimum time that Ruins used to pass the last position.
Of course, his speeding caught the attention of the traffic police. Police record
Now they want to know the minimum time that Ruins used to pass the last position.
Input
First line contains an integerT , which indicates the number of test cases.
Every test case begins with an integersN , which is the number of the recorded positions.
The second line containsN numbers a1 ,a2 ,⋯ ,aN , indicating the recorded positions.
Limits
1≤T≤100
1≤N≤105
0<ai≤109
ai<ai+1
Every test case begins with an integers
The second line contains
Limits
Output
For every test case, you should output'Case #x: y', where x indicates the case number and counts from1 and y is the minimum time.
Sample Input
136 11 21
Sample Output
Case #1: 4
题意:,给出n个点坐标,一辆车以不递减的速度行驶,路过每一个点的时间都是整数,问最短的时间。
题解:
刚上手感觉没法做的样子,后来倒着想。因为每过一个点的时间都是整数,求最短时间,所以最后一段所用的时间一定是1s
这样我们可以求得最后一段的速度。则前一段的速度<=这段的速度,时间=前一段的距离/这段的速度,向上取整,注意精度问题,用分数表示速度。
代码:
#include <bits/stdc++.h>#define ll long longusing namespace std;const int N=1e5+10;ll a[N];int T,n;int main(){ scanf("%d",&T); for(int i=1;i<=T;i++) { printf("Case #%d: ",i); scanf("%d",&n); for(int j=1;j<=n;j++) { scanf("%I64d",&a[j]); } ll output=0; ll fenmu,fenzi; for(int j=n;j>=1;j--) { if(j==n) { output++; fenzi=a[j]-a[j-1]; fenmu=1; } else { ll dis=a[j]-a[j-1]; fenmu*=dis; swap(fenzi,fenmu); ll tmp=fenzi/fenmu+1; if(fenzi%fenmu==0) tmp--; output+=tmp; fenzi=dis; fenmu=tmp; } } printf("%I64d\n",output); }}
0 0
- HDU 5935 Car(思维,模拟,精度)
- HDU 5935 Car(模拟+精度)
- HDU 5935 Car(贪心、精度爆炸)
- hdoj 5935 Car (模拟, 精度)
- HDU 5935 Car (模拟)
- HDU-5935 Car 逆推 贪心 精度
- HDU 5935 - Car(贪心)
- hdu 5935 Car(贪心)
- hdu5935 Car(贪心,精度)
- HDOJ 5935 Car【模拟】
- HDU 5935 Car 【模拟】 (2016年中国大学生程序设计竞赛(杭州))
- hdu 5935 Car【贪心】
- hdu 5935 Car
- hdu 5935 Car
- HDU 5935 Car 贪心
- HDU-5935-Car
- hdu 5935 Car
- HDU 5935 Car
- RosControl学习
- 苹果申请邓白氏码
- Linux性能分析的前60000毫秒
- RM崩溃:KeeperErrorCode = NoNode
- 做到这五点,就能让MCU低功耗
- HDU 5935 Car(思维,模拟,精度)
- 【leetcode】415 Add Strings
- CentOS下如何查看并杀死僵尸进程及kill后出现问题的解决办法
- 支付宝异步通知notify_url与return_url
- AFNetWorking https SSL认证
- Java读写Excel的三种方式
- 公司内局域网中的redis缓存和sock线程池,不在局域内运行程序怎么处理
- [BZOJ4521][Cqoi2016]手机号码(数位dp)
- Xilinx & Altera FPGA中的逻辑资源(Slices VS LE)比较