提出 #16806581

---

ソースコード 拡げる

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

#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define INF 1000000001
using lli = long long int;
using P = pair<lli, lli>;

bool invalid(P& p) {
  return (p.first == -1) || (p.second == -1) || (p.first == INF) || (p.second == INF);
}


lli dist(P& p, P& q) {
  if (invalid(p) || invalid(q)) return 0LL;
  return abs(p.first - q.first) + abs(p.second - q.second);
}

int main() {
  int N; cin >> N;

  P mx(INF, INF), Mx(-1, -1);
  P my(INF, INF), My(-1, -1);

  lli x, y;
  REP(n, N) {
    cin >> x >> y;
    mx = min(mx, {x, y});
    Mx = max(Mx, {x, y});
    my = min(my, {y, x});
    My = max(My, {y, x});
  }
  my = P{my.second, my.first};
  My = P{My.second, My.first};

  cout << max({ dist(mx, Mx), dist(mx, My), dist(my, Mx), dist(my, My), dist(mx, my), dist(Mx, My) }) << endl;

  return 0;
}

提出情報

ジャッジ結果