POJ - 1873 The Fortified Forest （凸包 + 枚举）
The Fortified Forest
Once upon a time, in a faraway land, there lived a king. This king owned a small collection of rare and valuable trees, which had been gathered by his ancestors on their travels. To protect his trees from thieves, the king ordered that a high fence be built around them. His wizard was put in charge of the operation.
Alas, the wizard quickly noticed that the only suitable material available to build the fence was the wood from the trees themselves. In other words, it was necessary to cut down some trees in order to build a fence around the remaining trees. Of course, to prevent his head from being chopped off, the wizard wanted to minimize the value of the trees that had to be cut. The wizard went to his tower and stayed there until he had found the best possible solution to the problem. The fence was then built and everyone lived happily ever after.
You are to write a program that solves the problem the wizard faced.
Input
The input contains several test cases, each of which describes a hypothetical forest. Each test case begins with a line containing a single integer n, 2 <= n <= 15, the number of trees in the forest. The trees are identified by consecutive integers 1 to n. Each of the subsequent n lines contains 4 integers xi, yi, vi, li that describe a single tree. (xi, yi) is the position of the tree in the plane, vi is its value, and li is the length of fence that can be built using the wood of the tree. vi and li are between 0 and 10,000.
The input ends with an empty test case (n = 0).
Output
For each test case, compute a subset of the trees such that, using the wood from that subset, the remaining trees can be enclosed in a single fence. Find the subset with minimum value. If more than one such minimum-value subset exists, choose one with the smallest number of trees. For simplicity, regard the trees as having zero diameter.
Display, as shown below, the test case numbers (1, 2, ...), the identity of each tree to be cut, and the length of the excess fencing (accurate to two fractional digits).
Display a blank line between test cases.
Sample Input
6 0 0 8 3 1 4 3 2 2 1 7 1 4 1 2 3 3 5 4 6 2 3 9 8 3 3 0 10 2 5 5 20 25 7 -3 30 32 0
Sample Output
Forest 1 Cut these trees: 2 4 5 Extra wood: 3.16 Forest 2 Cut these trees: 2 Extra wood: 15.00
题目链接：http://poj.org/problem?id=1873
题目大意：有n棵树，给出树的坐标,价值和做成的栅栏的长度 x,y,v,l，现在要砍掉一些树做成栅栏把剩下的树都围起来，问花费的最小价值是多少，如果价值相同，选择砍树少的方案，输出 要砍的树 和做完栅栏后多余的长度
思路：因为n最大为15，可以枚举所有情况，再求凸包，记录其中满足情况的最小花费和最小砍树数
代码：
#include
#include
#include
#include
using namespace std;
const int N=1<<15+5;
struct node
{
int x,y,v,l,id;
}e[20],a[20],s[20];
int vis[20];
bool cmp(node a,node b)
{
if(a.y==b.y) return a.x0) return 1;
else if(mm==0&&dis(e[0],a)-dis(e[0],b)<=0)
return 1;
return 0;
}
int n,tot;
void graham(int len)
{
sort(e,e+len,cmp);
sort(e+1,e+len,cmp1);
tot=1;
s[0]=e[0],s[1]=e[1];
for(int i=2;iminn) continue;
double p=fun();
if(p>1.0*sum) ans=-1;
if(ans!=-1&&ans