2009Round1C C

#define MAX_N 1000
#define INF 0x3f3f3f3f
int P,Q,A[MAX_N];

//释放(i~j) 所需要的金币
int dp[MAX_N][MAX_N];

void solve(){
        A[0] = 0;
        A[Q+1] = P + 1;
        //初始化
        for(int i = 0;i < Q; i++){
                dp[i][i+1] = 0;
                        
        }
        
        for(int w = 2; w <= Q + 1; w++){
                for(int i = 0;i + w <= Q+1; i++ ){
                        //计算dp[i][j]
                        int j = i + w, t = INF;
                        
                        //枚举最初释放的囚犯，计算最小的费用
                        for(int k = i+1; k < j; k++){
                                t = min(t, dp[i][k] + dp[k][j]);
                        }

                        //最初释放还需要与释放囚犯无关的A[j] - A[i] - 2
                        dp[i][j] = t + A[j] - A[i] - 2;
                }
        }
        printf("%d\n", dp[0][Q + 1]);

}