Submission #22937

---

Source Code Expand

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

typedef long long       li;
typedef vector<li>      vi;
typedef complex<double> pt;
typedef pair<pt, pt>    line;
typedef pair<li, li>    pi;
typedef vector<string>  vs;

#define rep(i,to)       for(li i=0;i<((li)to);i++)
#define foreach(it,set) for(__typeof((set).begin()) it=(set).begin();it!=(set).end();it++)
#define all(v)          v.begin(), v.end()

inline li bit(li n){ return 1LL<<n; }
template <class T> ostream& operator<<(ostream& os, vector<T> x){
  foreach(it, x) os << *it << ' ';
  return os;
}
template <class T> inline void dbg(T x){
  // return;
  cerr << x << endl; 
}

li vx[8] = {1, -1, 0,  0, -1, 1,  1, -1};
li vy[8] = {0,  0, 1, -1, -1, 1, -1,  1};

typedef complex<double> pt;

int main(){
  li n;
  cin >> n;
  vector<pt> p(n);
  double ans = 0;
  rep(i, n){
    cin >> p[i].real() >> p[i].imag();
  }
  rep(i,n){
    for(int j=i+1; j<n; j++){
      ans = max(ans, abs(p[i] - p[j]));
    }
  }
  printf("%.9f\n", ans);
  return 0;
}

Submission Info

Judge Result