Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int t,i,j,n,test;
- double maxx,k,d;
- double a[10007];
- map<double,double>mp;
- scanf("%d",&t);
- for(test=1; test<=t; test++)
- {
- maxx=0.0;
- scanf("%d",&n);
- for(i=0; i<n; i++)
- {
- scanf("%lf %lf",&a[i],&k);
- mp[a[i]]=k;
- }
- sort(a,a+n);
- for(i=0; i<n; i++)
- {
- for(j=i+1; j<n; j++)
- {
- d=abs(mp[a[j]]-mp[a[i]]);
- d=d/abs(a[j]-a[i]);
- maxx=max(maxx,d);
- }
- }
- printf("Case #%d: %.2lf\n",test,maxx);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement