Submission #4050794

---

Source Code Expand

#include <bits/stdc++.h>  // g++ -std=c++14 -o a a.cpp

using namespace std;

typedef pair<int, int> P;
typedef long long ll;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repto(i, n) for(int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;

int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

__attribute__((constructor))
void initial() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

int main() {
    int N;
    cin >> N;
    vector<complex<long double>> P;
    rep(i, N) {
        long double x, y;
        cin >> x >> y;
        complex<long double> c(x, y);
        P.pb(c);
    }
    long double result = 0.0;
    rep(i, N) {
        rep(j, N) {
            result = max(result, abs(P[i] - P[j]));
        }
    }
    cout << result << endl;
}

Submission Info

Judge Result