Submission #4051112

---

Source Code Expand

#include <iostream>


#include <cmath>
using namespace std;


int N ;
typedef pair<int, int> pint;
pint  points[200];




double length(){
  double s = 0;
  pint d ;
  for (size_t i = 0; i < N; i++) {
    for (size_t j = 0; j < N; j++) {
      d.first  =points[i].first - points[j].first ;
      d.second  =points[i].second - points[j].second ;
      s = max( s, std::sqrt( pow(d.first,2) + pow(d.second, 2) ) );
    }
  }
  return s;
}




int main(int argc, char const *argv[]) {
  cin >> N ;
  for (size_t i = 0; i < N; i++) {
  cin >>  points[i].first >> points[i].second;
  }

  double L = length();
  cout << L << endl;

  return 0;

}

Submission Info

Judge Result