Submission #2554833

---

Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<stack>
#include<string>
#include<set>
#include<vector>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<fstream>
#define Maxsize 10000
using namespace std;

typedef struct
{
	int x,y;
}point;
int main()
{
	int n,i,j;
	long long r,maxr=0;
	double R;
	cin>>n;
	point temp;
	vector<point>v;
	for(i=0;i<n;i++)
	{
		cin>>temp.x>>temp.y;
		v.push_back(temp);
	}
	for(i=0;i<n-1;i++)
	{
		for(j=i+1;j<n;j++)
		{
			r=(v[i].x-v[j].x)*(v[i].x-v[j].x)+(v[i].y-v[j].y)*(v[i].y-v[j].y);
			if(r>maxr)maxr=r;	
		} 
	}
	R=sqrt(maxr);
	cout<<R;
	return 0;
} 

Submission Info

Judge Result