【題目敘述】https://zerojudge.tw/ShowProblem?problemid=i428
【解題想法】迴圈
#include <bits/stdc++.h>
using namespace std;
int x[105], y[105];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++){
cin >> x[i] >> y[i];
}
int mn = 400, mx = 0;
for (int i = 2; i <= n; i++){
int dis = abs(x[i]-x[i-1])+abs(y[i]-y[i-1]);
mn = min(mn, dis);
mx = max(mx, dis);
}
cout << mx << " " << mn << "\n";
}