wode的专栏

//测试样例：//(3,l) (4,r) ()//(11,ll) (7,l) (8,lll) (7,l) (7,) ()//(11,ll) (7,lll) (4,l) (5,) ()//(11,ll) (7,l) (8,lll) (7,) ()//(11,ll) (8,lll) (7,) ()//(11,ll) (7,lll) (8,r) (5,) (4,l) (13,rl

#include#include#include#include#include#include #include#include#define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 10010using namespace std;char str[N];char

#include#include#include#include#include#include#include#include #define LL long long#define inf 0x7fffffff#define E 1e-9#define M 310#define N 505#define f(n,k) f[n+1][k+1]using namespa

#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 1000#define MIN 1e-11#define M 100#define LL long longusing namespace std;int n,k,h,t,m;int a[N],

#include#include#include#include#include#include#include #define inf 0x7fffffff#define N 1000#define MIN 1e-11#define M 100#define LL long longusing namespace std;int n,k,h,t,m;int a[N],

#include#include#include#include#include#include#include#include #define LL long long#define inf 0x7fffffff#define E 1e-9#define M 100#define N 1000005using namespace std;int n,k,h,m,e;

解答：题目中顶点坐标编号从1开始，为了方便编程，将顶点从0开始，顶点的编号变为0到7。定义t[i][j]，0=由于退化的两点多边形{Vi,Vi+1}的权值为0，t[i][i]=0。最优子结构的性质，t[i][j]的值是t[i][k]的值加上t[k][j]的值，再加上三角形ViVkVj的权值，其中，it[i][j]=t[i][k]+t[k][j]+w(i,k,j) (j-i>=2)