UVA 10304 Optimal Binary Search Tree

简单区间DP。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
 
const int maxn = ;
int n;
int a[maxn], sum[maxn], dp[maxn][maxn];
 
int main()
{
    while (~scanf("%d", &n))
    {
        sum[] = ;
        for (int i = ; i <= n; i++) scanf("%d", &a[i]);
        for (int i = ; i <= n; i++) sum[i] = sum[i - ] + a[i];
 
        memset(dp, , sizeof dp);
 
        for (int i = ; i <= n; i++)
        {
            for (int j = ; j+i- <= n; j++)
            {
                int st = j, en = j + i - ;
                int ans = 0x7FFFFFFF;
                for (int k = st; k <= en; k++)
                    ans = min(dp[st][k - ] + dp[k + ][en] + sum[en] - sum[st - ] - a[k],ans);
                dp[st][en] = ans;
            }
        }
        printf("%d\n", dp[][n]);
    }
    return ;
}