hdu 5112 A Curious Matt
http://acm.hdu.edu.cn/showproblem.php?pid=5112
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace std; 5 6 int t; 7 int n; 8 struct node 9 { 10 int t,x; 11 bool operator<(const node &a)const 12 { 13 return t<a.t; 14 } 15 }p[10001]; 16 17 int main() 18 { 19 scanf("%d",&t); 20 for(int cas=1; cas<=t; cas++) 21 { 22 scanf("%d",&n); 23 for(int i=0; i<n; i++) 24 { 25 scanf("%d%d",&p[i].t,&p[i].x); 26 } 27 sort(p,p+n); 28 double ans=0; 29 for(int i=1; i<n; i++) 30 { 31 double v=(double)(abs((p[i].x-p[i-1].x))*1.0/(p[i].t-p[i-1].t)); 32 ans=max(ans,v); 33 } 34 printf("Case #%d: %.2lf\n",cas,ans); 35 } 36 return 0; 37 }