Submission #3002847

---

Source Code Expand

#include<iostream>
#include<string>
#include<math.h>

using namespace std;
int main(void){
  int N;
  int x[100], y[100];
  long max = 0, temp;
  cin >> N;
  for(int i = 0; i < 100; i++){
    cin >> x[i] >> y[i];
  }
  //点を1個固定して，それ以外の点全てとの長さを求める
  for(int i = 0; i < 100; i++){
    for(int j = i; j < 100; j++){
      temp = sqrt(pow(x[i] - x[j], 2.0) + pow(y[i] - y[j], 2.0));
      if(temp > max){
        max = temp;
      }
    }
  }
  cout << max << endl;
  return 0;
}

Submission Info

Judge Result