HDU5935+(思路）+2016年中国大学生程序设计竞赛（杭州）

最新推荐文章于 2017-10-17 13:44:53 发布

旧时量刑

最新推荐文章于 2017-10-17 13:44:53 发布

阅读量403

点赞数

分类专栏： CST 2016年中国大学生程序设计竞赛（杭州）打开思路题文章标签： 2016年中国大学生程序设计竞赛杭州

本文链接：https://blog.csdn.net/hyyjiushiliangxing/article/details/75498321

版权

打开思路题同时被 2 个专栏收录

18 篇文章 0 订阅

订阅专栏

CST 2016年中国大学生程序设计竞赛（杭州）

3 篇文章 0 订阅

订阅专栏

Car

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

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<ai≤109

ai<ai+1

Output

For every test case, you should output 'Case #x: y', where x indicates the case number and counts from 1 and y is the minimum time.

Sample Input

Sample Output

Source

2016年中国大学生程序设计竞赛（杭州）

Recommend

liuyiding | We have carefully selected several similar problems for you: 6032 6031 6030 6029 6028

题意

一辆车开始行驶，速度不会减慢；给出两点之间的距离，每一次记录的花费时间都是整数，让你求出最小时间花费

思路

由于速度不会减小，且花费时间都是整数，则倒着来

最后两点之间的速度最大，且时间最小，v=a[n]-a[n-1];

这之前的速度<=之后的速度

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
int main()
{
    int t,T=1;
    int n;
    int a[100005];
    scanf("%d",&t);
    while(t--)
    {
        double v,mm;
        int m,sum;
        scanf("%d",&n);
        a[0]=0;
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        m=a[n]-a[n-1];
        v=m*1.0;
        sum=1;
        for(int i=n-1;i>0;i--)
        {
            //cout<<v<<endl;
            for(int j=(a[i]-a[i-1])/v;;j++)//时间逐渐增大,求出最大速度
            {
                double mm=(a[i]-a[i-1])*1.0/j;
               // cout<<j<<" "<<v<<endl;
                if(mm<=v)
                {
                    sum+=j;
                    v=mm;
                    break;
                }
            }
        }
        printf("Case #%d: %d\n",T++,sum);
    }
}

Car