Submission #23022

---

Source Code Expand

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

typedef long long ll;
typedef pair<int,int> P;

const int MAX = 100;
int main(){
   int n;
   double x[MAX],y[MAX];
   cin >> n;
   for(int i=0; i<n; i++) cin >> x[i] >> y[i];

   double ans = 0;
   for(int i=0; i<n; i++){
      for(int j=0; j<n; j++){
         if(i == j)continue;
         ans = max(ans,sqrt((x[i]-x[j])*(x[i]-x[j])+
                         (y[i]-y[j])*(y[i]-y[j])));
      }
   }
   cout << fixed << setprecision(6);
   cout << ans << endl;
  return 0;
}

Submission Info

Judge Result