Pagini recente » Cod sursa (job #808922) | Cod sursa (job #622935) | Cod sursa (job #2540625) | Cod sursa (job #2671078) | Cod sursa (job #122701)
Cod sursa(job #122701)
Utilizator |
Mircea Pasoi domino |
Data |
13 ianuarie 2008 15:22:10 |
Problema |
Inundatii |
Scor |
Ascuns |
Compilator |
cpp |
Status |
done |
Runda |
|
Marime |
0.61 kb |
#include <stdio.h>
#define MAX_N 50005
#define FIN "inundatii.in"
#define FOUT "inundatii.out"
#define ll long long
#define abs(x) ((x) < 0 ? -(x) : (x))
int N, X[MAX_N], Y[MAX_N], Z[MAX_N];
ll solve(int A[])
{
int i, med = A[N/2]-N/2;
ll ret = 0;
for (i = 0; i < N; ++i)
ret += abs(A[i]-(med+i));
return ret;
}
int main(void)
{
int i;
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
scanf("%d", &N);
for (i = 0; i < N; ++i)
scanf("%d %d %d", X+i, Y+i, Z+i);
printf("%lld\n", solve(X)+solve(Y)+solve(Z));
return 0;
}