Submission #5292765

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define trep(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main()
{
    int n;
    cin >> n;
    int x[n];
    int y[n];
    rep(i, n)
    {
        cin >> x[i] >> y[i];
    }
    double ans = 0;
    rep(i, n)
    {
        rep(j, n)
        {
            double dx, dy, d;
            dx = fabs(x[i] - x[j]);
            dy = fabs(y[i] - y[j]);
            d = sqrt(dx * dx + dy * dy);
            if (ans < d)
            {
                ans = d;
            }
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result