Submission #5173690

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main(void){

    int n;
    cin >> n;

    vector<pair<int,int>> points(n);
    for(int i=0; i<n; i++) {
        pair<int, int> point;
        cin >> point.first;
        cin >> point.second;
        points[i] = point;
    }

    double max = 0;
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(i==j) continue;
            double length = sqrt(pow((points[j].first-points[i].first), 2) + pow((points[j].second-points[i].second), 2));
            if(max < length) max = length;
        }
    }

    cout << max << endl;

    return 0;
    
}

Submission Info

Judge Result