【水题】 POJ 2926 Requirements

和HDOJ4666一样的。。。同一篇论文的题目。。。不过这道题不能用STL做，不然会TLE。。用普通的数组记录就行了。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define maxm 1000005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

struct node
{
	double x[5];
}p[maxn];
double mx[1 << 5], mi[1 << 5];
int n;

void init(void)
{
	for(int i = 0; i < (1 << 5); i++) mx[i] = -INF, mi[i] = INF;
}

void work(void)
{
	int cnt = 0, kk;
	for(int i = 1; i <= n; i++) {
		for(int j = 0; j < 5; j++) scanf("%lf", &p[i].x[j]);
		for(int j = 0; j < (1 << 5); j++) {
			double t = 0;
			for(int k = 0; k < 5; k++) {
				if((j >> k) & 1) t += p[i].x[k];
				else t -= p[i].x[k];
			}
			mx[j] = max(mx[j], t);
			mi[j] = min(mi[j], t);
		}
		cnt++;
	}
	if(!cnt || cnt == 1) {
		printf("0.00\n");
		return;
	}
	double ans = 0;
	for(int i = 0; i < (1 << 5); i++)
		ans = max(ans, mx[i] - mi[i]);
	printf("%.2f\n", ans);
}

int main(void)
{
	while(scanf("%d", &n)!=EOF) {
		init();
		work();
	}

	return 0;
}