Pagini recente » Cod sursa (job #2990967) | Istoria paginii runda/1000101-1 | Cod sursa (job #1285587) | Cod sursa (job #2683363) | Cod sursa (job #478927)
Cod sursa(job #478927)
#include<fstream>
using namespace std;
const char iname[]="inundatii.in";
const char oname[]="inundatii.out";
const int maxn=50005;
ifstream f(iname);
ofstream g(oname);
int x[maxn],y[maxn],z[maxn],i,n,b[maxn];
int abs(int a)
{
if(a<0)
return -a;
return a;
}
long long calc(int *a)
{
long long s=0,v=a[n/2+1]-n/2-1;
for(int i=1;i<=n;++i)
s+=abs(a[i]-v-i);
return s;
}
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>x[i]>>y[i]>>z[i];
g<<calc(x)+calc(y)+calc(z)<<"\n";
}