Pagini recente » Cod sursa (job #2138115) | Cod sursa (job #2328386) | Cod sursa (job #405467) | Cod sursa (job #2292578) | Cod sursa (job #1783024)
#include <fstream>
using namespace std;
ifstream fin("inundatii.in");
ofstream fout("inundatii.out");
const int nmax= 50000;
int v[nmax+1][3];
int solve( int n, int k ) {
int sol= 0;
for ( int i= 1; i<=n; ++i ) {
sol= sol+max((n+1)/2-i, i-(n+1)/2)+max(v[(n+1)/2][k]-v[i][k], v[i][k]-v[(n+1)/2][k]);
}
return sol;
}
int main( ) {
int n;
fin>>n;
for ( int i= 1; i<=n; ++i ) {
fin>>v[i][0]>>v[i][1]>>v[i][2];
}
int sol= solve(n, 0)+solve(n, 1)+solve(n, 2);
fout<<sol<<"\n";
return 0;
}