Submission #5332797

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main(){
    int N,sum=0;
    cin>>N;
    pair<int,int> P[N];
    for (int i=0;i<N;i++){
          cin>>P[i].fi>>P[i].se;
    } 
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            if(i==j)continue;
    else {int m=(P[i].fi-P[j].fi)*(P[i].fi-P[j].fi)+(P[i].se-P[j].se)*(P[i].se-P[j].se);
     sum=max(m,sum);
    }
    }
    }
    double d=0;
    d=(double)sqrt(sum);
    cout<<d<<endl;

}

Submission Info

Judge Result