C++ :

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

int n, minx = INT_MAX, miny = INT_MAX, maxx = INT_MIN, maxy = INT_MIN, x, y, r;

int main() {
    cin >> n;

    // 求方形需要覆盖到的最左侧、最右侧、最上方、最下方
    for (int i = 1; i <= n; i++) {
        cin >> x >> y >> r;
        minx = min(minx, x - r);
        miny = min(miny, y - r);
        maxx = max(maxx, x + r);
        maxy = max(maxy, y + r);
    }

    cout << max(maxx - minx, maxy - miny);

    return 0;
}