Submission #23042

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  int N;
  vector<pair<double,double> > v;
  cin >> N;
  rep(i,N){
    double x, y;
    cin >> x >> y;
    v.push_back(make_pair(x,y));
  }

  double maxd = 0.0;
  rep(i,N) REP(j,i+1,N) {
    double tmpd = sqrt( (v[i].first-v[j].first)*(v[i].first-v[j].first)+(v[i].second-v[j].second)*(v[i].second-v[j].second) );
    maxd = max(maxd, tmpd);
  }

  printf("%.10lf\n", maxd);
  
  return 0;
}

Submission Info

Judge Result