Submission #5947097

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007;

int main(){
    
    int N;cin>>N;
    vector<pair<int,int>> S(N);
    for(int i=0;i<N;i++){
        cin>>S[i].first>>S[i].second;
    }
    int ans=0;
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            ans=max(ans,(S[j].first-S[i].first)*(S[j].first-S[i].first)+(S[j].second-S[i].second)*(S[j].second-S[i].second));
        }
    }
    cout<<setprecision(15)<<sqrt(ans)<<endl;
}

Submission Info

Judge Result