Submission #3003359

---

Source Code Expand

#include <bits/stdc++.h>
//#include <mylib.h>
using namespace std;
//cin.sync_with_stdio(false);

#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define FOR_EQ(i,a,b) for(int i = (a); i <= (b); ++i)
#define FOR_RE(i,a,b) for(int i = (a); i > (b); --i)
#define rep(i,n) FOR(i,0,n)
#define rep_eq(i,n) FOR_EQ(i,0,n)
#define rep_re(i,n) FOR_RE(i,n,0)
//1個上から時計周り
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
//上右下左
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};

typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> Vector;
typedef vector<Vector>	DVector;
int n;

typedef struct _coordinate
{
    int x;
    int y;
}Coordinate;

int main(int argc, char const *argv[])
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> n;
    Coordinate d[n];
    rep(i, n){
        cin >> d[i].x >> d[i].y;
    }
    double distance;
    double max_dis = 0;
    rep(i, n - 1){
        FOR(j, i + 1, n){
            distance = sqrt(pow(d[i].x - d[j].x, 2) + pow(d[i].y - d[j].y, 2));
            max_dis = max(max_dis, distance);
        }
    }
    cout << max_dis << endl;
    return 0;
}

Submission Info

Judge Result