Submission #3003106

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<ll, ll>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

double dist2(P a, P b) {
    pair<double, double> p1 = {a.first, a.second};
    pair<double, double> p2 = {b.first, b.second};
    return (p1.first-p2.first)*(p1.first-p2.first)+(p1.second-p2.second)*(p1.second-p2.second);
}

int main() {
    int n;
    cin >> n;
    vector<P> p(n);
    rep(i, n) cin >> p[i].first >> p[i].second;
    double ma = 0;
    rep(i, n) rep(j, n) {
        ma = max(ma, sqrt(dist2(p[i], p[j])));
    }
    printf("%.10f\n", ma);
    return 0;
}

Submission Info

Judge Result