hdu 5112 手速

http://acm.hdu.edu.cn/showproblem.php?pid=5112'

delta(x)/delta(t)最大值,水题..

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <iostream>
#include <sstream>
#include <algorithm>
using namespace std;
#define RD(x) scanf("%d",&x)
#define RD2(x,y) scanf("%d%d",&x,&y)
#define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define clr0(x) memset(x,0,sizeof(x))
#define clr1(x) memset(x,-1,sizeof(x))
#define eps 1e-9
const double pi = acos(-1.0);
typedef long long LL;
const int inf = 1000000000;
const int maxn = 2e5 + 5;
map<int,int > hash;
#define t first
#define x second
typedef pair<int,int> p2;

p2 s[maxn];
int a[maxn];
double work()
{
    int n;
    RD(n);
    for(int i = 0;i < n;++i)
        RD2(s[i].t,s[i].x);
    sort(s,s+n);
    double ans = 0;
    for(int i = 1;i < n;++i){
        ans = max(ans,(double)(abs(s[i].x - s[i-1].x))/((double)(s[i].t - s[i-1].t)));
    }
    return ans;
}
int main()
{
    int _,cas = 1;
    RD(_);
    while(_--){
        printf("Case #%d: %.2lf\n",cas++,work());
    }
    return 0;
}