[UVa1331]Minimax Triangulation

Problem Description

My Problem Report

过题以后又把代码读了两遍，上Udebug对拍了几发。简直不敢想象它是怎么A的。

My Source Code

//  Created by Chlerry in 2015.
//  Copyright (c) 2015 Chlerry. All rights reserved.
//

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define Size 100000
#define ll long long
#define mk make_pair
#define pb push_back
#define mem(array, x) memset(array,x,sizeof(array))
#define cp(x1,y1,x2,y2) x1*y2-x2*y1  //cross_product
#define S(i,j,k) abs(cp((x[k]-x[i]),(y[k]-y[i]),(x[k]-x[j]),(y[k]-y[j])))
typedef pair<int,int> P;
int T,n;
ll x[60],y[60],f[60][60];

bool Check(int i,int j,int k)
{
    i%=n;j%=n;k%=n;
    for(int p=0;p<n;p++)
        if(p==i || p==j || p==k)
            continue;
        else if(S(i,j,k)==S(i,j,p)+S(i,k,p)+S(j,k,p))
            return 0;
    return 1;
}
int main()
{
    freopen("in.txt","r",stdin);
    cin>>T;
while(T--)
{
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>x[i]>>y[i];
    x[n]=x[0],y[n]=y[0];
    for(int i=0;i+2<=n;i++)
    {
        ll vx1=x[i]-x[i+1],vy1=y[i]-y[i+1];
        ll vx2=x[i+2]-x[i+1],vy2=y[i+2]-y[i+1];
        f[i][i+2]=-cp(vx1,vy1,vx2,vy2);
        if(f[i][i+2]<0)
            f[i][i+2]=INT_MAX;
    }
    for(int i=n-3;i>=0;i--)
        for(int j=i+2;j<=n;j++)
        {
            f[i][j]=INT_MAX;
            for(int k=i+1;k<j;k++)
                if(Check(i,j,k))
                    f[i][j]=min( f[i][j],max( S(i,j,k),max(f[i][k],f[k][j]) ) );
        }
    printf("%.1f\n",(double)f[0][n]/2.0);
}
    return 0;
}