Submission #5303478

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <math.h>
#include <sstream>
#include <numeric>
#include <string>

using namespace std;

int main()
{
  int N;
  cin >> N;
  vector<int> x(N);
  vector<int> y(N);
  for (int i = 0; i < N; ++i) {
    cin >> x[i] >> y[i];
  }
  float ans = 0.0;
  for (int i = 0; i < N; ++i) {
    for (int j = i + 1; j < N; ++j) {
      float dx = float(x[i] - x[j]);
      float dy = float(y[i] - y[j]);
      float dist = sqrt(dx * dx + dy * dy);
      ans = max(ans, dist);
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result