#include<iostream>
#include<algorithm>
using namespace std;
int x[200000],y[200000],z[200000];
bool cmp(int &z1,int &z2)
{
	return z1>z2;
}
int main()
{
	int n,i,j,z1,z2,z3;
	__int64 sum;
	while(scanf("%d",&n)==1&&n!=0)
	{
		sum=0;
		for(i=0;i<n;i++)
		{
			scanf("%d %d %d",&z1,&z2,&z3);
			x[i]=z1-z2;y[i]=z2-z3;z[i]=z3-z1;
		}
		sort(x,x+n,cmp);
		sort(y,y+n,cmp);
		sort(z,z+n,cmp);
		for(i=0;i<n;i++)
		{
			for(j=i+1;j<n;j++)
			{
				sum=sum+((x[i]-x[j])+(y[i]-y[j])+(z[i]-z[j]))/2;
			}
		}
		printf("%I64d\n",sum);
	}
}

• Re:TLE help; (132) beiyouyu 2007-07-09 13:16:58
  • Re:TLE help; (152) hduOZ 2007-07-09 13:33:22
    • Re:TLE help; (8) hduOZ 2007-07-09 13:34:48
      • Re:TLE help; (483) beiyouyu 2007-07-09 14:14:16
        • Re:TLE help; (169) hduOZ 2007-07-09 15:17:52