HDU You Are the One (dp)

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int Ni = 105;
const int inf = 1<<27;
int n,num[Ni],sum[Ni],d[Ni][Ni];
inline int min(int a,int b) {return a<b? a:b;}
int dp(int i,int j)
{
    int ans=inf;
    if(d[i][j]!=inf) return d[i][j];
    if(i==j) return d[i][j]=0;
    d[i+1][j]=dp(i+1,j);
    ans=min(ans,d[i+1][j]+sum[j]-sum[i]);
    ans=min(ans,d[i+1][j]+num[i]*(j-i));
    for(int k=i+1;k<j;k++)
    {
        d[i+1][k]=dp(i+1,k);
        d[k+1][j]=dp(k+1,j);
        ans=min(ans,d[i+1][k]+d[k+1][j]+num[i]*(k-i)
                +(sum[j]-sum[k])*(k-i+1));
    }
    return d[i][j]=ans;
}
int main()
{
    int t,i,j,cs=1;sum[0]=0;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d",&n);
        for (i=1;i<=n;i++)
        {
            scanf("%d",num+i);
            sum[i]=sum[i-1]+num[i];
        }
        for (i=1;i<=n;i++)
            for (j=1;j<=n;j++) d[i][j]=inf;
        printf("Case #%d: %d\n",cs++,dp(1,n));
    }
    return 0;
}