DLU-1032 元气殿下，在线炸楼

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
int max(int a,int b)
{
    return a>b?a:b;
}
 
int maxDestroy(int* nums, int numsSize) {
    int arr[numsSize+2];
    int i,j,k;
    for(i = 1;i < numsSize+1;i ++)
    {
        arr[i] = nums[i-1];
    }
    arr[0] = arr[numsSize+1]=1;
     
    int dp[numsSize+2][numsSize+2];
    for(i = 0;i < numsSize+2;i ++)
        for(j = 0;j < numsSize+2;j ++)
            dp[i][j] = 0;
    int n = numsSize+2;
     
    for(k = 2;k < n;k ++)
    {
        int left,right;
        for(left = 0;left<n-k;left++)
        {
            right = left+k;
            for(i = left+1;i < right;i ++)
            {
                dp[left][right] = max(dp[left][right],
                                      arr[left]*arr[i]*arr[right]+dp[left][i]+dp[i][right]);
            }
        }
    }
    return dp[0][n-1];
}
int main()
{
    int building_num;
    while(~scanf("%d",&building_num))
    {
        int i;
        int nums[building_num];
        for(i = 0;i < building_num;i ++)
        {
            scanf("%d",&nums[i]);
        }
        int result = maxDestroy( nums, building_num);
        printf("%d\n",result);
    }
    return 0;
}