Submission #23260

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>

using namespace std;

int main(int argc, char const* argv[])
{
    int N;
    vector<pair<int,int> > map;
    cin >> N;
    for (int i=0; i<N; i++) {
        int tmp1,tmp2;
        cin >> tmp1 >> tmp2;
        map.push_back(make_pair(tmp1,tmp2));
    }
    int max = 0;
    for (int i=0; i<N; i++) {
        for (int j=i+1; j<N; j++) {
            max = (max < (map[i].first - map[j].first) * (map[i].first - map[j].first)  + (map[i].second - map[j].second) * (map[i].second- map[j].second) ?  (map[i].first - map[j].first) * (map[i].first - map[j].first)  + (map[i].second - map[j].second) * (map[i].second- map[j].second):max);
        }
    }
    cout << setprecision(10) << sqrt(double(max)) << endl;
    return 0;
}

Submission Info

Judge Result