Submission #5214471

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>

typedef long long ll;
using namespace std;

int main(){
  int n;
  cin >> n;
  int x[n],y[n];
  for (int i=0;i<n;i++) cin >> x[i] >> y[i];
  float dist=0.;
  for (int i=0;i<n;i++){
    for (int j=0;j<n && j<i;j++){
      float dist2 = sqrt( 1.*((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j])) );
      dist = max(dist, dist2 );
    }
  }
  cout << dist << endl;
}

Submission Info

Judge Result