Submission #2415508

---

Source Code Expand

#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#include <algorithm>
#include <cmath>
#include <assert.h>

using namespace std;

class Point {
public:
  Point(int x_, int y_) : x(x_), y(y_) {}
  int x;
  int y;
};

int distance(Point& p1, Point& p2)
{
  return (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y);
}

double longest(vector<Point>& ps)
{
  int max = 0;
  for (int i = 0; i < ps.size(); i++) {
    for (int j = 0; j < ps.size(); j++) {
      max = std::max(max, distance(ps[i], ps[j]));
    }
  }
  return (double)max;
}

int main()
{
  int n;
  cin >> n;

  vector<Point> ps;
  
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    ps.push_back(Point(x, y));
  }
  
  cout << sqrt(longest(ps)) << endl;
  
  return 0;
}

Submission Info

Judge Result