zoukankan      html  css  js  c++  java
  • HDU 5112 A Curious Matt

                                  A Curious Matt

                                 Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
                                  Total Submission(s): 3369    Accepted Submission(s): 1876


    Problem Description
    There is a curious man called Matt.

    One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt finds it interesting to know the maximal speed Ted may reach. In order to do so, Matt takes records of Ted’s position. Now Matt has a great deal of records. Please help him to find out the maximal speed Ted may reach, assuming Ted moves with a constant speed between two consecutive records.
     
    Input
    The first line contains only one integer T, which indicates the number of test cases.

    For each test case, the first line contains an integer N (2 ≤ N ≤ 10000),indicating the number of records.

    Each of the following N lines contains two integers ti and xi (0 ≤ ti, xi ≤ 106), indicating the time when this record is taken and Ted’s corresponding position. Note that records may be unsorted by time. It’s guaranteed that all ti would be distinct.
     
    Output
    For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1), and y is the maximal speed Ted may reach. The result should be rounded to two decimal places.
     
    Sample Input
    2 3 2 2 1 1 3 4 3 0 3 1 5 2 0
     
    Sample Output
    Case #1: 2.00 Case #2: 5.00
    Hint
    In the first sample, Ted moves from 2 to 4 in 1 time unit. The speed 2/1 is maximal. In the second sample, Ted moves from 5 to 0 in 1 time unit. The speed 5/1 is maximal.
     
    Source
    Recommend
    liuyiding
    参考代码:
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int maxn = 10010;
     4 struct node
     5 {
     6     int t, x;
     7 }a[maxn];
     8 
     9 bool cmp(node a, node b)
    10 {
    11     return a.t < b.t;
    12 }
    13 
    14 int main()
    15 {
    16     int t;
    17     scanf("%d", &t);
    18     for(int k = 1; k <= t; k++)
    19     {
    20         int n;
    21         scanf("%d", &n);
    22         for(int i = 0; i < n; i++)
    23             scanf("%d%d", &a[i].t, &a[i].x);
    24         sort(a, a + n, cmp);
    25         double ans = 0;
    26         for(int i = 1; i < n; i++)
    27         {
    28             double cur = (a[i].x - a[i - 1].x) * 1.0 / (a[i].t - a[i - 1].t);
    29             cur = fabs(cur);
    30             ans = max(ans, cur);
    31         }
    32         printf("Case #%d: %.2f
    ", k, ans);
    33     }
    34     return 0;
    35 }
    View Code

      

  • 相关阅读:
    《Java TCP/IP Socket 编程 》读书笔记之十一:深入剖析socket——TCP套接字的生命周期
    c++实现二分查找
    hadoop序列化机制与java序列化机制对比
    C、C++中“*”操作符和“后++”操作符的优先级
    poj2774之最长公共子串
    Python之美[从菜鸟到高手]--urlparse源码分析
    (程序员面试题)字符串处理之寻找最大不重复子串
    hdu 4782 Beautiful Soupz
    教程Xcode 下编译发布与提交App到AppStore
    云端的ABAP Restful服务开发
  • 原文地址:https://www.cnblogs.com/csushl/p/9710540.html
Copyright © 2011-2022 走看看