Submission #2707209

---

Source Code Expand

#include <iostream>
#include <cmath>

using namespace std;

int main(int argc, char const* argv[])
{
	int n;
	cin >> n;
	int *x = new int[n];
	int *y = new int[n];
	for(int i = 0; i < n; i++){
			cin >> x[i] >> y[i];
	}
	int max = -1;
	for(int i = 0; i < n - 1; i++){
			for(int j = i + 1; j < n; j++){
					int dis = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
					if(dis > max)max = dis;
			}
	}
	cout << sqrt(max) << endl;
	return 0;
}

Submission Info

Judge Result