POJ - 2926 Requirements

题目：

Description

An undergraduate student, realizing that he needs to do research to improve his chances of being accepted to graduate school, decided that it is now time to do some independent research. Of course, he has decided to do research in the most important domain: the requirements he must fulfill to graduate from his undergraduate university. First, he discovered (to his surprise) that he has to fulfill 5 distinct requirements: the general institute requirement, the writing requirement, the science requirement, the foreign-language requirement, and the field-of-specialization requirement. Formally, a requirement is a fixed number of classes that he has to take during his undergraduate years. Thus, for example, the foreign language requirement specifies that the student has to take 4 classes to fulfill this requirement: French I, French II, French III, and French IV. Having analyzed the immense multitude of the classes that need to be taken to fulfill the different requirements, our student became a little depressed about his undergraduate university: there are so many classes to take…

Dejected, the student began studying the requirements of other universities that he might have chosen after high school. He found that, in fact, other universities had exactly the same 5 requirements as his own university. The only difference was that different universities had different number of classes to be satisfied in each of the five requirement.

Still, it appeared that universities have pretty similar requirements (all of them require a lot of classes), so he hypothesized that no two universities are very dissimilar in their requirements. He defined the dissimilarity of two universities X and Y as |x₁ − y₁| + |x₂− y₂| + |x₃ − y₃| + |x₄ − y₄| + |x₅ − y₅|, where an x_i (y_i) is the number of classes in the requirement i of university X (Y) multiplied by an appropriate factor that measures hardness of the corresponding requirement at the corresponding university.

Input

The first line of the input file contains an integer N (1 ≤ N ≤ 100 000), the number of considered universities. The following Nlines each describe the requirements of a university. A university X is described by the five non-negative real numbers x₁ x₂ x₃ x₄x₅.

Output

On a single line, print the dissimilarity value of the two most dissimilar universities. Your answer should be rounded to exactly two decimal places.

Sample Input

32 5 6 2 1.51.2 3 2 5 47 5 3 2 5

Sample Output

12.80

点（x1,x2,x3,x4,x5）和（y1,y2,y3,y4,y5）的曼哈顿距离是：

a1(x1-y1)+a2(x2-y2)+a3(x3-y3)+a4(x4-y4)+a5(x5-y5)，其中a取1或者-1

在这样的32个组合中，最大的就是曼哈顿距离了。

用了一点点状态压缩的技巧，用0-31表示这32个二进制5位数，然后把1，0变成1，-1

这样就取遍了32个组合。

代码：

#include<iostream>#include<limits>using namespace std;double list[32];double maxs[32];double mins[32];int main(){for (int i = 0; i < 32; i++)maxs[i] = numeric_limits<double>::max()*-1;for (int i = 0; i < 32; i++)mins[i] = numeric_limits<double>::max();int n;cin >> n;double x;while (n--){for (int i = 0; i < 32; i++)list[i] = 0;for (int k = 0; k < 5; k++){cin >> x;for (int i = 0; i < 32; i++)list[i] += x*((i >> k) % 2 * 2 - 1);}for (int i = 0; i < 32; i++)if (list[i]>maxs[i])maxs[i] = list[i];for (int i = 0; i < 32; i++)if (list[i]<mins[i])mins[i] = list[i];}double m = 0;for (int i = 0; i < 32; i++)if (maxs[i] - mins[i]>m)m = maxs[i] - mins[i];printf("%.2f\n", m);return 0;}