Cod sursa(job #124718)
Utilizator | Adrian Diaconu DITzoneC | Data | 19 ianuarie 2008 19:30:04 |
---|---|---|---|
Problema | Inundatii | Scor | Ascuns |
Compilator | cpp | Status | done |
Runda | Marime | 0.44 kb |
#include <stdio.h>
#define nmax 50111
#define FOR(i,s,d) for(i=(s);i<(d);++i)
typedef long long lint;
int n,A[3][nmax];
lint sol;
int mod(int a) { return a>0?a:-a; }
int main()
{
freopen("inundatii.in","r",stdin);
freopen("inundatii.out","w",stdout);
int i,j,a;
scanf("%d",&n);
FOR(i,0,n) FOR(j,0,3)
scanf("%d",&A[j][i]);
FOR(j,0,3)
{
a=A[j][n/2]-n/2;
FOR(i,0,n)
sol+=mod(a+i-A[j][i]);
}
printf("%lld\n",sol);
return 0;
}