【瞎搞】 HDU 5112 A Curious Matt 水

点击打开链接

排序搞

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long  LL;
const int MAXN = 230+1;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
struct node
{
    int x,t;
}a[100010];
bool cmp(node a,node b)
{
    return a.t<b.t;
}
int main()
{
#ifndef ONLINE_JUDGE
       freopen("in.txt", "r", stdin);
   //  freopen("out.txt", "w", stdout);
#endif
    int t,n,cas=1;
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(int i=0;i<n;i++)
            scanf("%d%d",&a[i].t,&a[i].x);
        sort(a,a+n,cmp);
        double xx=0;
        for(int i=1;i<n;i++)
        {
            xx=max(xx,abs(a[i].x-a[i-1].x)*1.0/(a[i].t-a[i-1].t));
        }
        printf("Case #%d: %.2lf\n",cas++,xx);
    }
}