Submission #3993947

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <array>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;

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

typedef long long ll;

template<class T>bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if (b < a) {a = b; return 1;} return 0;}

ll n;

int main() {
    cin >> n;

    ll xc[n], yc[n];
    float result = 0;
    float ans[n * (n - 1) / 2];

    for (int i = 0; i < n; i++)
        cin >> xc[i] >> yc[i];
    
    int cont = 0;
    for (int x = 0; x < n; x++) {
        for (int y = x + 1; y < n; y++) {
            ans[cont] = sqrt(pow(abs(xc[x] - xc[y]), 2) + pow(abs(yc[x] - yc[y]), 2));
            result = max(result, ans[cont]);
            cont++;
        }
    }

    cout << result;
}

Submission Info

Judge Result