Submission #4174795

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <functional>
#include <stack>
#include <numeric>
typedef long long ll;
using namespace std;
const int MOD = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;
//#define int long long

struct Point {
	double x, y;

	double dis(Point a, Point b) {
		double x = a.x - b.x;
		double y = a.y - b.y;
		return sqrt(x*x + y * y);
	}
};



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;
	vector<Point> P(N);
	double Max = 0;

	for (int i = 0; i < N; i++)
	{
		cin >> P[i].x >> P[i].y;
	}

	for (int i = 0; i < N-1; i++)
	{
		for (int j = i+1; j < N; j++)
		{
			double tmp = P[i].dis(P[i], P[j]);
			Max = max(Max, tmp);
		}
	}

	printf("%f\n", Max);

	return 0;
}

Submission Info

Judge Result