Submission #4043402

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
#include <memory>
#include <algorithm>
using namespace std;
class P
{
public:
  int x, y;
  P(int X, int Y)
  :x(X), y(Y)
  {

  }
};
int main()
{
  int N;
  cin >> N;

  vector<unique_ptr<P>> ps(N);
  for(int i = 0; i < N; i++)
  {
    int x, y;
    cin >> x;
    cin >> y;
    unique_ptr<P> p(new P(x, y));
    ps[i] = move(p);
  }

  const auto dump = [&ps]
  {
    for(auto &p : ps)
    {
        cout<<p->x <<", "<<p->y<<endl;
    }
  };
  // dump();
  const auto getDistance = [&ps](int i, int j)
  {
    return sqrt((ps[j]->x-ps[i]->x)*(ps[j]->x-ps[i]->x)+(ps[j]->y-ps[i]->y)*(ps[j]->y-ps[i]->y));
  };

  double m = 0;
  for(int i = 0; i < N-1; i++)
  {
    for(int j = i+1; j < N; j++ )
    {
      m = max(m, getDistance(i,j));
    }
  }
  cout << m <<endl;
  return 0;
}

Submission Info

Judge Result