Submission #1218132

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deque>

using namespace std;

#define mod 1000000007

double getlength(double x1, double y1, double x2, double y2)
{
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

int main()
{
	int n;
	cin >> n;
	double x[101], y[101];
	for(int i = 0; i < n; i++){
		cin >> x[i] >> y[i];
	}
	double ans = 0.0;
	for(int i = 0; i < n; i++){
		for(int j = i + 1; j < n; j++){
			ans = max(ans, getlength(x[i], y[i], x[j], y[j]));
		}
	}
	printf("%.10f\n", ans);
	return 0;
}

Submission Info

Judge Result