Submission #17829232

---

Source Code Expand

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

using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i,j,n) for (ll i = j; i < (ll)(n); ++i)
const ll INF = 1LL << 60;

template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    ll N;
    cin >> N;
    vector<P> p(N);
    rep(i, N){
        ll x, y;
        cin >> x >> y;
        p.at(i) = P(x, y);
    }
    vector<int> index(N);
    rep(i,N) index.at(i)=i;
    ll ans = 0;
    do{
        auto [x0, y0] = p.at(index.at(0));
        auto [x1, y1] = p.at(index.at(1));
        chmax(ans, abs(x0-x1)+abs(y0-y1));
    }while(next_permutation(index.begin(), index.end()));

    cout << ans << endl;
}

Submission Info

Judge Result