Saleh127

Untitled

May 15th, 2020
138
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.36 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define test int t; cin>>t; while (t--)
  4. #define ll long long int
  5. #define sc(a) scanf("%lld",&a)
  6. #define pf(a) printf("%lld",a)
  7. #define sc2(a,b) scanf("%lld %lld",&a,&b)
  8. int main()
  9. {
  10. ll cas,a[100000],c[100000],d,e,f,i,j,k,t,x;
  11. cin>>cas;
  12. for(x=1;x<=cas;x++)
  13. {
  14. cin>>e;
  15. for(i=0;i<e;i++)
  16. {
  17. cin>>a[i];
  18. f=a[i];
  19. cin>>c[f];
  20. }
  21. sort(a,a+e);
  22. double ans=0.0,l=0.0;
  23. for(i=0;i<e;i++)
  24. {
  25. t=a[i+1]-a[i];
  26. d=abs(c[a[i+1]]-c[a[i]]);
  27. l=(double)d/t;
  28. ans=max(l,ans);
  29. }
  30. printf("Case #%lld: %.2lf\n",x,ans);
  31. }
  32.  
  33. return 0;
  34. } /*
  35. another process
  36. int main()
  37. {
  38. ll t,i,j,k,x,c,m,d;
  39. cin>>t;
  40. for(x=1;x<=t;x++)
  41. {
  42. cin>>c;
  43. vector <pair<ll, ll> > a;
  44. for(i=0;i<c;i++)
  45. {
  46. cin>>m>>d;
  47. a.push_back(make_pair(m,d));
  48. }
  49. sort(a.begin(),a.end());
  50. double ans=0.00;
  51. for(i=0;i<c;i++)
  52. {
  53. ll ttime=a[i+1].first-a[i].first;
  54. ll distanc=abs(a[i+1].second-a[i].second);
  55. double l=(double)distanc/ttime;
  56. ans=max(ans,l);
  57. }
  58. printf("Case #%lld: %.2lf\n",x,ans);
  59. }
  60. return 0;
  61. }
  62. */
Advertisement
Add Comment
Please, Sign In to add comment