区间DP 最大面积最小的三角形划分

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define INF 0x3f3f3f3f
#define eps 1e-7
using namespace std;
int n;
double x[66],y[66],dp[66][66];
double cal(int a,int b,int c){
	double x1=x[a]-x[c];
	double y1=y[a]-y[c];
	double x2=x[b]-x[c];
	double y2=y[b]-y[c];
	return fabs((x1*y2-x2*y1)/2);
}
bool judge(int a,int b,int c){
	double s=cal(a,b,c);
	for(int i=0;i<n;i++){
		if(i==a || i==b || i==c) continue;
		double s1=cal(a,b,i)+cal(a,c,i)+cal(b,c,i);
		if(fabs(s1-s)<eps) return 0;
	}
	return 1;
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(int i=0;i<n;i++) scanf("%lf%lf",&x[i],&y[i]);
		for(int i=n-1;i>=0;i--){
			for(int j=i+2;j<n;j++){
				dp[i][j]=INF;
				for(int k=i+1;k<j;k++)
				if(judge(i,j,k))
				dp[i][j]=min(dp[i][j],max(max(dp[i][k],dp[k][j]),cal(i,j,k)));
			}
		}
		printf("%.1f\n",dp[0][n-1]);
	}
}