HDU - 5112 A Curious Matt

水题

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 10000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int T, n;

struct node {
    double t, x;
}a[maxn];
bool cmp(node a, node b) {
    return a.t < b.t;
}


int main() {
    scanf("%d", &T);
    int kase = 1;
    while(T--) {
        scanf("%d", &n);
        for(int i = 0; i < n; ++i)
            scanf("%lf %lf", &a[i].t, &a[i].x);
        sort(a, a+n, cmp);
        double ans = 0;
        for(int i = 1; i < n; ++i) {
            ans = max(ans, (fabs((a[i].x-a[i-1].x))/(a[i].t-a[i-1].t)));
        }
        printf("Case #%d: %.2lf\n", kase++, ans);
    }


    return 0;
}