zoukankan      html  css  js  c++  java
  • HDU5037(SummerTrainingDay01-C)

    Frog

    Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
    Total Submission(s): 4467    Accepted Submission(s): 1069


    Problem Description

    Once upon a time, there is a little frog called Matt. One day, he came to a river.

    The river could be considered as an axis.Matt is standing on the left bank now (at position 0). He wants to cross the river, reach the right bank (at position M). But Matt could only jump for at most L units, for example from 0 to L.

    As the God of Nature, you must save this poor frog.There are N rocks lying in the river initially. The size of the rock is negligible. So it can be indicated by a point in the axis. Matt can jump to or from a rock as well as the bank.

    You don't want to make the things that easy. So you will put some new rocks into the river such that Matt could jump over the river in maximal steps.And you don't care the number of rocks you add since you are the God.

    Note that Matt is so clever that he always choose the optimal way after you put down all the rocks.
     

    Input

    The first line contains only one integer T, which indicates the number of test cases.

    For each test case, the first line contains N, M, L (0<=N<=2*10^5,1<=M<=10^9, 1<=L<=10^9).

    And in the following N lines, each line contains one integer within (0, M) indicating the position of rock.
     

    Output

    For each test case, just output one line “Case #x: y", where x is the case number (starting from 1) and y is the maximal number of steps Matt should jump.
     

     

    Sample Input

    2
    1 10 5
    5
    2 10 3
    3
    6
     

     

    Sample Output

    Case #1: 2
    Case #2: 4
     

    Source

     
     1 //2017-10-08
     2 #include <cstdio>
     3 #include <iostream>
     4 #include <cstring>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 const int N = 200010;
    10 int arr[N], n, m, l, ans, T;
    11 
    12 int main(){
    13     int kase = 0;
    14     scanf("%d", &T);
    15     while(T--){
    16         scanf("%d%d%d", &n, &m, &l);
    17         arr[0] = 0;
    18         arr[n+1] = m;
    19         for(int i = 1; i <= n; i++)
    20             scanf("%d", &arr[i]);
    21         sort(arr, arr+n+1);
    22         ans = 0;
    23         int k = l;
    24         for(int i = 1; i <= n+1; i++){
    25             int a = (arr[i]-arr[i-1])%(l+1);
    26             int b = (arr[i]-arr[i-1])/(l+1);
    27             if(a+k >= l+1){
    28                 k = a;
    29                 ans += 2*b+1;
    30             }else{
    31                 k += a;
    32                 ans += 2*b;
    33             }
    34         }
    35         cout<<"Case #"<<++kase<<": "<<ans<<endl;
    36     }
    37 
    38     return 0;
    39 }
  • 相关阅读:
    PHP语言参考类型/变量/常量/表达式/运算符/控制结构/函数
    代码的可维护性问题
    null与DBNull转换到String型
    Sqlserver数据库表空间统计
    MS SqlServer中少用但是好用的SQL语句[原创]
    数据库安装没装好,害死人啊
    PHP语言参数类与对象
    PHP,MySQL的安装与配置
    PHP特性
    在NebBean中配置常用插件调试/预览页面/打开项目文件夹/JS代码提示
  • 原文地址:https://www.cnblogs.com/Penn000/p/7637370.html
Copyright © 2011-2022 走看看