题目描述:
用面积和最小的矩形来覆盖给出的点,求最小的面积。预处理。
题解:
很好的一道题.用状压来表示哪些点被覆盖过了.之后就是用什么矩形来覆盖?因为矩形的先后顺序没有关系,因此当所有备选矩形出来之后就类似一个背包,矩形:所有两个点组成的矩形,最优解一定可以拆分成这样.因为这道题的特例,面积为0的不算,那么如果两个点在一条直线,必须把长或者宽从0变成1.并且顺便变就行(因为如果会影响到最终答案,一定有另外的矩形来充当)
重点:
关键是看出需要备选的矩形来更新答案.暴力
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <ctype.h>
#include <limits.h>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#define CLR(a) memset(a, 0, sizeof(a))
#define REP(i, a, b) for(int i = a;i < b;i++)
#define REP_D(i, a, b) for(int i = a;i <= b;i++)
typedef long long ll;
using namespace std;
const int maxn_key = (1 << 15) + 100;
const int key = (1<<15) - 1;
const int maxn = 500;
const int INF = INT_MAX/2 - 1;
struct rectang
{
int s, cover_statue;
};
vector<rectang> a;
int dp[maxn_key];
int x[maxn], y[maxn], n;
int statue;
int x_left, y_low, this_l, this_r;
int get_s(int a, int b)
{
int l = 1, r = 1;//防止是0
l = max(l, (int)(abs(x[a] - x[b]) +0.1) );
r = max(r, (int)(abs(y[a] - y[b]) +0.1));
this_l = l;
this_r = r;
statue = 0;
x_left = min(x[a], x[b]);//搞出左下的点
y_low = min(y[a], y[b]);
return l*r;
}
int is_in(int i)
{
if(x[i] >= x_left && x[i] <= x_left + this_l && y[i] >= y_low && y[i] <= y_low + this_r)
return 1;
return 0;
}
void get_a()//预处理矩形
{
a.clear();
REP(i, 0, n)
{
REP(j, i + 1, n)
{
rectang temp;
temp.s = get_s(i, j);
temp.cover_statue = 0;
REP(k, 0, n)
{
if(is_in(k))
{
temp.cover_statue = (temp.cover_statue|(1<<k));
}
}
a.push_back(temp);
}
}
}
void get_dp()
{
REP_D(i, 0, key)
{
dp[i] = INF;
}
dp[0] = 0;
REP(i, 0, a.size())
{
REP_D(j, 0, key)
{
if(dp[j] != INF)
{
int k = (j|a[i].cover_statue);
dp[k] = min(dp[k], dp[j] + a[i].s);
}
}
}
}
void solve()
{
get_a();
//printf("%d\n", a.size());
get_dp();
printf("%d\n", dp[(1<<n) - 1]);
}
int main()
{
//freopen("1Ain.txt", "r", stdin);
//freopen("1Aout.txt", "w", stdout);
while(scanf("%d", &n) != EOF)
{
//printf("%d--n\n", n);
if(n == 0)
break;
REP(i, 0, n)
{
scanf("%d%d", &x[i], &y[i]);
}
solve();
}
return 0;
}