Pagini recente » Cod sursa (job #1056091) | Cod sursa (job #471851) | Cod sursa (job #1567918) | Cod sursa (job #1033725) | Cod sursa (job #1932969)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("inundatii.in");
ofstream fout("inundatii.out");
const int NMax = 5e4 + 5;
const int INF = 1e9;
int D[NMax][3];
inline int MOD(int x) {
return max(x, -x);
}
int main() {
ios::sync_with_stdio(false);
int n;
fin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 0; j < 3; j++) {
fin >> D[i][j];
}
}
long long int pr = 0;
for(int i = 0; i < 3; i++) {
int mid = (n + 1) >> 1;
long long int ans = 0;
for(int j = 1; j <= n; j++) {
ans = ans + MOD(D[mid][i] - D[j][i]) + MOD(mid - j);
}
pr += ans;
}
fout << pr;
return 0;
}