pku2926.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#define SIZE 100001
#define INF 1e30

int N;
double v[SIZE][5];
int sg[4];
void Solve()
{
	int i, j, p;
	double ans = 0;
	double min, max, sum;
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < 5; j++)
		{
			scanf("%lf", &v[i][j]);
		}
	}
	for (p = 0; p < 16; p++)
	{
		for (j = 0; j < 4; j++)
		{
			if (p & (1 << (j)))
				sg[j + 1] = 1;
			else
				sg[j + 1] = -1;
		}
		sg[0] = 1;
		min = INF;
		max = -INF;
		for (i = 0; i < N; i++)
		{
			sum = 0;
			for (j = 0; j < 5; j++)
				sum += sg[j] * v[i][j];
			if (sum > max)
				max = sum;
			if (sum < min)
				min = sum;
		}
		if (ans < max - min)
			ans = max - min;
	}
	printf("%.2lf\n", ans);
}
int main()
{
	while (EOF != scanf("%d", &N) && N)
		Solve();
	return 0;
}