CF 1140D 区间DP

D. Minimum Triangulation
You are given a regular polygon with n vertices labeled from 1 to n in counter-clockwise order. The triangulation of a given polygon is a set of triangles such that each vertex of each triangle is a vertex of the initial polygon, there is no pair of triangles such that their intersection has non-zero area, and the total area of all triangles is equal to the area of the given polygon. The weight of a triangulation is the sum of weigths of triangles it consists of, where the weight of a triagle is denoted as the product of labels of its vertices.
Calculate the minimum weight among all triangulations of the polygon.
Input
The first line contains single integer n (3≤n≤500) — the number of vertices in the regular polygon.
Output
Print one integer — the minimum weight among all triangulations of the given polygon.
Examples
input
3
output
6
input
4
output
18
Note
According to Wiki: polygon triangulation is the decomposition of a polygonal area (simple polygon) P into a set of triangles, i. e., finding a set of triangles with pairwise non-intersecting interiors whose union is P.
In the first example the polygon is a triangle, so we don’t need to cut it further, so the answer is 1⋅2⋅3=6.
In the second example the polygon is a rectangle, so it should be divided into two triangles. It’s optimal to cut it using diagonal 1−3 so answer is 1⋅2⋅3+1⋅3⋅4=6+12=18.
代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=505;
ll a[maxn],dp[maxn][maxn];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i)a[i]=i*1ll;
        for(int len=3;len<=n;++len)
		for(int i=1;i<=n-len+1;++i){
			int j=i+len-1;
			dp[i][j]=1e9;
			for(int k=i+1;k<j;++k)dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+a[i]*a[k]*a[j]);
		}
        printf("%I64d\n",dp[1][n]);
	return 0;
}