Submission #2572762

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <utility>
#include <algorithm>

int main(int argc, char* argv[])
{
  int n;
  std::vector< std::pair< double, double > > vp;
  std::vector< std::pair< double, double > >::iterator it;
  std::vector< std::pair< double, double > >::iterator it2;
  std::cin >> n;
  for (int i = 0; i < n; i++) {
    double x, y;
    std::cin >> x >> y;
    vp.push_back(std::make_pair(x, y));
  }

  double dist_max = 0;
  for (it = vp.begin(); it != vp.end(); it++) {
    for (it2 = it; it2 != vp.end(); it2++) {
      double dist = std::sqrt((it->first - it2->first) * (it->first - it2->first) + (it->second - it2->second) * (it->second - it2->second));
      dist_max = std::max(dist_max, dist);
    }
  }

  printf("%.6f\n", dist_max);
  return 0;
}

Submission Info

Judge Result