4605. 最大周长

4605. 最大周长 - AcWing题库

#include <bits/stdc++.h>
#define LL long long 
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e9 + 10;
const int N = 1e6;

int x[N];
int y[N];
int n;

int main(){

    int u = -INF,r = -INF;
    int d = INF,l = INF;
    cin >> n;
    for(int i = 0;i < n;i ++){
        cin >> x[i];
        cin >> y[i];

        u = max(u,y[i]);
        d = min(d,y[i]);
        l = min(l,x[i]);
        r = max(r,x[i]);
    }

    int res = 0;
    for(int i = 0;i < n;i ++){
        res = max(res,max(u - y[i],y[i] - d) + max(r - x[i] , x[i] - l));
    }
    cout << 2 * res << " ";

    for(int i = 4; i <= n;i ++){
        cout << 2 * (u - d + r - l) << " ";
    }

    return 0;
}