三角枚舉基礎

區間DP（2）–三角剖分 題目如下 You are given a regular polygon with nn vertices labeled from 11 to nn in counter-clockwise order. The triangulation of a given polygon is a set of triangles such that each vertex of

>>阅读原文<<