UVA 1331 Minimax Triangulation - ACM/ICPC NWERC 2004

#include<bits/stdc++.h>
using namespace std;
int n,x[60],y[60];
double dp[60][60];
double s(int i,int j,int k){
	return fabs((x[j]-x[i])*(y[k]-y[i])-(x[k]-x[i])*(y[j]-y[i]))/2.0;
}
bool check(int i,int j,int k){
	for(int t=1;t<=n;t++){
		if(t==i||t==j||t==k)continue;
		if(fabs(s(i,j,k)-s(i,j,t)-s(i,k,t)-s(j,k,t))<=1e-7)return 0;
	}
	return 1;
}
int main(){
	int i,j,k,cas;
	scanf("%d",&cas);
	while(cas--){
		scanf("%d",&n);
		for(i=1;i<=n;i++)
			scanf("%d%d",&x[i],&y[i]);
		memset(dp,0,sizeof(dp));
		for(i=1;i<n;i++)
			dp[i][i+1]=0;
		for(i=n-2;i>=1;i--)
			for(j=i+2;j<=n;j++){
				dp[i][j]=0x3f3f3f3f;
				for(k=i+1;k<j;k++)
					if(check(i,j,k))
						dp[i][j]=min(dp[i][j],max(max(dp[i][k],dp[k][j]),s(i,j,k)));
			}
		printf("%.1lf\n",dp[1][n]);
	}
	return 0;
}