Submission #23215

---

Source Code Expand

#include <iostream>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
typedef long long ll;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
typedef pair<double,double> P;
vector<P> v;
void solve(){
}
int main(void ){
  int n;
  cin >> n;

  rep(i,n){
    double x,y;
    cin >> x >> y;
    v.push_back(P(x,y));
  }
  double ans=0;

  rep(i,v.size()){
    REP(j,i+1,v.size()){

      double dx=v[i].first-v[j].first;
      double dy=v[i].second-v[j].second;
      double d=sqrt(dx*dx+dy*dy);

      ans = max (d,ans);
    }
  }
  printf("%.5lf\n",ans);
  return 0;
}

Submission Info

Judge Result