UVA1331
题解
- dp[i][j]表示从区间[i,j]最大三角形的最小值,中间找一点k。
- 状态转移为:dp[i][j] = min(dp[i][j],max(getarea(p[i],p[j],p[k]),max(dp[i][k],dp[k][j])));
- 边界条件dp[i][i+1] = 0,其余初始化inf
- 如果出现上面的情况ABD,就不能组成三角形,中间包含点C。我们判断SABC + SACD + SBCD - SABD是否为0。
代码
#include <bits/stdc++.h>
using namespace std;
int const N = 50 + 10;
double const eps = 1e-8;
double const inf = 1e10;
double dp[N][N];
int dcmp(double x){
if(fabs(x) <= eps) return 0;
else return x < 0 ? -1 : 1;
}
typedef struct Point{
double x,y;
Point(){}
Point(double x,double y):x(x),y(y){};
Point operator - (const Point& e)const{
return Point(x - e.x,y - e.y);
}
bool operator == (const Point& e)const{
return !dcmp(x - e.x) && !dcmp(y - e.y);
}
}Vector;
int n;
Point p[N];
double Cross(Vector A,Vector B){
return A.x * B.y - A.y * B.x;
}
double getarea(Point A,Point B,Point C){
return fabs(Cross(B - A,C - A)) / 2;
}
bool Judge(Point A,Point B,Point C){
for(int i=0;i<n;i++){
if(p[i] == A || p[i] == B || p[i] == C) continue;
double ans = getarea(A,B,p[i]) + getarea(A,C,p[i]) + getarea(B,C,p[i]) - getarea(A,B,C);
if(fabs(ans) <= eps) return false;
}
return true;
}
int main(){
int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
for(int i=n-1;i>=0;i--){
dp[i][i+1] = 0; //边界条件
for(int j=i+2;j<n;j++){
dp[i][j] = inf;
for(int k=i+1;k<j;k++){
if(!Judge(p[i],p[j],p[k])) continue;
dp[i][j] = min(dp[i][j],max(getarea(p[i],p[j],p[k]),max(dp[i][k],dp[k][j])));
}
}
}
printf("%.1lf\n",dp[0][n-1]);
}
return 0;
}
ZOJ3537
题解
- 首先判断是否是凸包,Andrew算法走一遍,判断点的个数是否减少。
- 最优三角剖分。这是求一条割线的花费,如果切到边,就无花费。所以预处理任意两点之间的花费。
代码
#include <bits/stdc++.h>
using namespace std;
int const N = 300 + 10;
int const inf = 0x7f7f7f7f;
int n,P;
int dp[N][N],f[N][N];
typedef struct Point
{
int x,y;
Point(){};
Point(int x,int y):x(x),y(y){}
Point operator - (const Point& e)const{
return Point(x - e.x,y - e.y);
}
bool operator < (const Point& e)const{
return x < e.x || (x == e.x && y < e.y);
}
}Vector;
Point p[N],ch[N];
int Cross(Vector A,Vector B){
return A.x * B.y - A.y * B.x;
}
int cal(int i,int j){
return (abs(ch[i].x + ch[j].x) * abs(ch[i].y + ch[j].y))% P;
}
int Convex(Point *p,int n,Point *ch){
sort(p,p+n);
int m = 0;
for(int i=0;i<n;i++){
while(m > 1 && Cross(ch[m-1] - ch[m-2],p[i] - ch[m-2]) <= 0) m--;
ch[m++] = p[i];
}
int k = m;
for(int i=n-2;i>=0;i--){
while(m > k && Cross(ch[m-1] - ch[m-2],p[i] - ch[m-2]) <= 0) m--;
ch[m++] = p[i];
}
if(n > 1) m--;
return m;
}
int main(){
while(~scanf("%d%d",&n,&P)){
for(int i=0;i<n;i++)
scanf("%d%d",&p[i].x,&p[i].y);
if(Convex(p,n,ch) < n){
printf("I can't cut.\n");
continue;
}
for(int i=0;i<n;i++){
for(int j=i+2;j<n;j++){
f[i][j] = f[j][i] = cal(i,j);
}
}
for(int i=n-3;i>=0;i--){ //从后往前,保证计算到dp[i][j]时,dp[k][j]已经被计算过了
dp[i][i+1] = 0;
for(int j=i+2;j<n;j++){
dp[i][j] = inf;
for(int k=i+1;k<j;k++)
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k][j] + f[i][k] + f[k][j]);//这里不能直接用cal,因为边不消耗代价
}
}
printf("%d\n",dp[0][n-1]);
}
return 0;
}