Cake ZOJ - 3537(凸包+三角剖分的区间DP(记忆化搜索+递推))

题意：传送门
题解：首先判断是否构成凸包，是凸包使用最优三角剖分的思想实现，对于一个n个顶点的凸多边形，有很多种方法可以对它进行三角剖分，即用n-3条互不相交的对角线把凸多边形分成n-2个三角形。为每个三角形规定一个权值函数w(i,j,k),求让所有三角形权和最大的方案。定义dp[i][j]为自多边形从i到j的最优值，那么边i-j的最优解中一定对应一个三角形i-k-j，那么就符合最优子结构和重叠子问题的性质了。

/*
*Auther:yaozhuojiang
*Date:2019-05-06-09.50.12
*/
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int eps=1e-10;
const int maxn=3e2+50;
const int inf=0x3f3f3f3f;
int dcmp(double x){if(fabs(x)<=eps)return 0;else return x<0?-1:1;}
struct Point{
    double x,y;
    Point(double _x=0,double _y=0):x(_x),y(_y){}
    Point operator + (Point p){return Point(x+p.x,y+p.y);}
    Point operator - (Point p){return Point(x-p.x,y-p.y);}
    Point operator * (double k){return Point(x*k,y*k);}
    Point operator / (double k){return Point(x/k,y/k);}
    friend bool operator < (const Point& a,const Point& b){return a.x<b.x||(a.x==b.x&&a.y<b.y);}
};
int n,m,cost[maxn][maxn],dp[maxn][maxn];
Point p[maxn],ch[maxn];
bool vis[maxn][maxn];
typedef Point Vector;
double cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;}
int convexHull()
{
    sort(p,p+n);
    int m=0;
    for(int i=0;i<n;i++){
        while(m>1&&dcmp(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&&dcmp(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 dfs(int l,int r)
{
    if(vis[l][r])return dp[l][r];
    vis[l][r]=true;
    for(int k=l+1;k<r;k++){
        dp[l][r]=min(dp[l][r],dfs(l,k)+dfs(k,r)+cost[l][k]+cost[k][r]);
    }
    return dp[l][r];
}
int calc(Point a,Point b)
{
    int temp=(fabs(a.x+b.x)*fabs(a.y+b.y));
    temp%=m;
    return temp;
}
int main()
{
    while(scanf("%d%d",&n,&m)==2){
        for(int i=0;i<n;i++)scanf("%lf%lf",&p[i].x,&p[i].y);
        if(n==3){
            printf("0\n");
            continue;
        }
        int cnt=convexHull();
        if(cnt<n){
            printf("I can't cut.\n");
        }else{
            memset(cost,0,sizeof(cost));
            memset(dp,inf,sizeof(dp));
            memset(vis,false,sizeof(vis));
            for(int i = 0; i < n; i++){
                for(int j = i+2; j < n; j++){
                    cost[i][j] = cost[j][i] = calc(ch[i],ch[j]);
                }
                dp[i][(i+1)%n]=0;vis[i][(i+1)%n]=true;
            }
//            printf("%d\n",dfs(0,n-1));
            for(int i = n-3; i >= 0; i--){
                for(int j = i+2; j < n; j++){
                    for(int k = i+1; k < j; k++){
                        dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]+cost[i][k]+cost[k][j]);
                    }
                }
            }
            printf("%d\n",dp[0][n-1]);
        }
    }
    return 0;
}