Submission #552840

---

Source Code Expand

#include <stdint.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <limits>
#include <tuple>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstdio>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
 
using namespace std;
 
typedef long long          ll;
typedef unsigned int       uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static const double PI  = acos(-1.0);
 
#define FOR(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define REP(i,n)   for (int i=0;i<(int)(n);i++)
#define ALL(a)     (a).begin(),(a).end()
#define DEBUG(x)   cout<<#x<<": "<<x<<endl

int main() {
  int N;
  cin >> N;
  vector<pair<int, int>> xy(N);
  REP(i, N) {
    cin >> xy[i].first >> xy[i].second;
  }
  double m = 0;
  REP(i, N) {
    FOR(j, i + 1, N) {
      m = max(m, sqrt(pow(xy[i].first - xy[j].first, 2) + pow(xy[i].second - xy[j].second, 2)));
    }
  }
  printf("%0.9f\n", m);
}

Submission Info

Judge Result