Submission #46980

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<complex>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<cstring>
#include<cassert>
using namespace std;

#define REP(i,x,n) for(int i = x ; i < (int)(n) ; i++)
#define rep(i,n) REP(i, 0, n)
#define f first
#define s second
#define mp make_pair
#define pb push_back

typedef pair<int,int> P;
typedef long long ll;
typedef complex<double> Point;

static const int INF = (1<<29);
static const double EPS = 1e-9;
static const double PI = acos(-1.0);

int n;
Point p[100];

int main(){
  cin >> n;
  rep(i,n){
    int x,y;
    cin >> x >> y;
    p[i] = Point(x,y);
  }
  double ans = 0;
  rep(i,n){
    rep(j,n){
      ans = max(ans,abs(p[i]-p[j]));
    }
  }
  printf("%.10f\n",ans);
  return 0;
}

Submission Info

Judge Result