Submission #5246461

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i=0, i##_len=(n); i<i##_len; ++i)
#define FOR(i, a, b) for (int i=(a); i<(b); ++i)
using ll = long long;
using namespace std;

int main()
{
    int N;
    cin >> N;
    int X[N], Y[N];
    REP(i, N) cin >> X[i] >> Y[i];

    double ret = 0;
    REP(i, N-1) FOR(j, i+1, N)
        ret = max(ret, hypot(X[i]-X[j], Y[i]-Y[j]));

    cout << ret << endl;
    return 0;
}

Submission Info

Judge Result