Submission #3641935

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>

using namespace std;

#define REP(i,s,e) for(int i=(s);i<(e);i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef unsigned long long ull;

int main(void) {
  int N; cin >> N;
  vector<pair<int, int>> C(N);
  rep(i, N) cin >> C[i].first >> C[i].second;

  int x1, y1, x2, y2;
  double md = 0.0, d;
  rep(i, N) REP(j, i + 1, N) {
    tie(x1, y1) = C[i];
    tie(x2, y2) = C[j];
    d = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
    md = max(d, md);
  }

  printf("%0.10f\n", md);
  return 0;
}

Submission Info

Judge Result