Submission #2945315

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <set>
#include <iterator>

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

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

inline double distance(P a, P b) {
    double x = abs(a.first - b.first);
    double y = abs(a.second - b.second);
    return sqrt(x*x + y*y);
}

int main() {
    int n;
    cin >> n;
    vector<P> vec;
    vec.reserve(n);
    rep(i, n) {
        cin >> vec[i].first >> vec[i].second;
    }

    double ans = 0.0;
    rep(i, n - 1) {
        for(int j = i + 1; j < n; ++j) {
            double dis = distance(vec[i], vec[j]);
            if (ans < dis) {
                ans = dis;
            }
        }
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result