HDU 5935 Car (模拟)

最新推荐文章于 2019-09-22 10:07:15 发布

原创最新推荐文章于 2019-09-22 10:07:15 发布 · 620 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

模拟专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个关于计算车辆从起点到终点最短时间的问题。给定一系列不带时间标记的位置记录，目标是找出车辆通过最后一个位置所需的最短时间。文章包含了一个C++实现的示例代码，展示了如何通过算法来解决这个问题。

Car

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 590 Accepted Submission(s): 205

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 record N positions of Ruins without time mark, the only thing they know is every position is recorded at an integer time point and Ruins started at 0.

Now they want to know the minimum time that Ruins used to pass the last position.

Input
First line contains an integer T, which indicates the number of test cases.

Every test case begins with an integers N, which is the number of the recorded positions.

The second line contains N numbers a1, a2, ⋯, aN, indicating the recorded positions.

Limits
1≤T≤100
1≤N≤105
0

#include "cstring"
#include "cstdio"
#include "string.h"
#include "iostream"
#include "cmath"
#include "algorithm"
using namespace std;
#define MAX 100005
#define exp 0.00000000001
int main()
{
    int t;
    scanf("%d",&t);
    int cas=1;
    while(t--)
    {
        int n;
        scanf("%d",&n);
        int a[MAX];
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        a[0]=0;
        int totaltime=1;
        double vmax=(double)(a[n]-a[n-1]);
        for(int i=n-1;i>=1;i--)
        {
            double dis=1.0*(a[i]-a[i-1]);
            int time=dis/vmax;
            totaltime+=time;
            //if(time*vmax!=dis)
            if(dis/time!=vmax)
            {
                totaltime++;
                vmax=dis/(time+1);
            }
            else
                vmax=dis/time;

        }
        printf("Case #%d: %d\n",cas++,totaltime);
    }
}