Cod sursa(job #920208)
Utilizator | Apopeid Alejandro apopeid13 | Data | 20 martie 2013 09:30:34 |
---|---|---|---|
Problema | Inundatii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include<stdlib.h>
using namespace std;
ifstream f("inundatii.in");
ofstream g("inundatii.out");
int a[50001],b[50001],c[50001],n,i;
long long s,m1,m2,m3;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i]>>b[i]>>c[i];
m1=a[(n+1)/2]-(n+1)/2;
m2=b[(n+1)/2]-(n+1)/2;
m3=c[(n+1)/2]-(n+1)/2;
for(i=1;i<=n;i++)
s+=abs(a[i]-(m1+i))+abs(b[i]-(m2+i))+abs(c[i]-(m3+i));
g<<s;
}