Submission #595222

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <queue>
#include <stack>
#include <sstream>
using namespace std;

#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll>::iterator vit;
typedef queue<ll> qi;
typedef stack<ll> si;

int main(){
	int n, a[1000], b[1000];
	double r = 0;
	cin >> n;
	REP(i, n){
		cin >> a[i] >> b[i];
	}
	REP(i, n){
		REP(j, n){
			if (i != j){
				if (r < pow(pow(a[i] - a[j], 2.0) + pow(b[i] - b[j], 2.0), 0.5)){
					r = pow(pow(a[i] - a[j], 2.0) + pow(b[i] - b[j], 2.0), 0.5);
				}
			}
		}
	}
	cout << r << "\n";
}

Submission Info

Judge Result