zoukankan      html  css  js  c++  java
  • SDAU课程练习--problemO(1014)

    题目描述

    Before bridges were common, ferries were used to transport cars across rivers. River ferries, unlike their larger cousins, run on a guide line and are powered by the river’s current. Cars drive onto the ferry from one end, the ferry crosses the river, and the cars exit from the other end of the ferry.
    There is a ferry across the river that can take n cars across the river in t minutes and return in t minutes. m cars arrive at the ferry terminal by a given schedule. What is the earliest time that all the cars can be transported across the river? What is the minimum number of trips that the operator must make to deliver all cars by that time?

    Input

    The first line of input contains c, the number of test cases. Each test case begins with n, t, m. m lines follow, each giving the arrival time for a car (in minutes since the beginning of the day). The operator can run the ferry whenever he or she wishes, but can take only the cars that have arrived up to that time.

    Output

    For each test case, output a single line with two integers: the time, in minutes since the beginning of the day, when the last car is delivered to the other side of the river, and the minimum number of trips made by the ferry to carry the cars within that time.

    You may assume that 0 < n, t, m < 1440. The arrival times for each test case are in non-decreasing order.

    Sample Input

    2
    2 10 10
    0
    10
    20
    30
    40
    50
    60
    70
    80
    90
    2 10 3
    10
    30
    40
    
    

    Sample Output

    100 5
    50 2
    
    

    题目大意

    渡口的船每次运n条船,过一次河用时t。给定m条船及其到达渡口的时间表。求最早运送的时间及最少次数。

    解题思路

    • 则总时间 = 最后一辆车的到达时间+最后一辆车的等待时间+单程时间
    • 问题转化为求最后一辆车的最小等待时间
    1. #include<iostream>
    2. #include<stdio.h>
    3. #include<algorithm>
    4. using namespace std;
    5. bool cmp(int a, int b)
    6. {
    7. return a > b;
    8. }
    9. int a[1500];
    10. int main()
    11. {
    12. ios::sync_with_stdio(false);
    13. //freopen("date.in", "r", stdin);
    14. //freopen("date.out", "w", stdout);
    15. int N = 0, n = 0, t = 0, m = 0,count=0,time=0;
    16. cin >> N;
    17. for (int i = 0; i < N; i++)
    18. {
    19. count = 0;
    20. time = 0;
    21. cin >>n>> t >> m;
    22. for (int j = 1; j <= m; j++)
    23. {
    24. cin>>a[j];
    25. }
    26. //sort(a, a + n, cmp);
    27. if (n >= m)
    28. {
    29. count = 1;
    30. time = a[m]+2 * t;
    31. }
    32. else
    33. {
    34. if (m%n==0)
    35. {
    36. count = m / n;
    37. for (int l = n; l <= m; l += n)
    38. {
    39. time = max(a[l], time);
    40. time += (2 * t);
    41. }
    42. }
    43. else {
    44. count = m / n + 1;
    45. time = a[m%n] + 2 * t;
    46. //time = a[1] + 2 * t;
    47. for (int k = m%n + n; k <= m; k += n)
    48. {
    49. time = max(a[k], time);
    50. time += (2 * t);
    51. }
    52. }
    53. }
    54. cout << time-t << " " << count << endl;
    55. }
    56. return 0;
    57. }




  • 相关阅读:
    SpringCloud2.0 Eureka Client 服务注册 基础教程(三)
    美国会计准则 Generally Accepted Accounting Principles (GAAP) 与 中国会计准则
    JavaScript的订阅者模式--实现一个简单的事件监听框架
    设计模式在外卖营销业务中的实践
    20行代码做一个简易微信群发工具需要哪些单词
    南怀瑾老师:一阴一阳之谓道,是个什么道?
    怎么追女生?
    正态分布(Normal distribution)也称“常态分布”,又名高斯分布
    广义线性模型
    逻辑回归表达式
  • 原文地址:https://www.cnblogs.com/liuzhanshan/p/5335383.html
Copyright © 2011-2022 走看看