Pagini recente » Cod sursa (job #560705) | Cod sursa (job #2437462) | Cod sursa (job #308419) | Cod sursa (job #1820864) | Cod sursa (job #2479243)
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
const int N = 50000 + 7;
int n;
int a[N], b[N], c[N];
int main() {
freopen ("inundatii.in", "r", stdin);
freopen ("inundatii.out", "w", stdout);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
a[i] -= i;
b[i] -= i;
c[i] -= i;
}
ll ans = 0;
int half = (n + 1) / 2;
for (int i = 1; i <= n; i++) {
ans += abs(a[i] - a[half]);
ans += abs(b[i] - b[half]);
ans += abs(c[i] - c[half]);
}
cout << ans << "\n";
return 0;
}