hdu--5115--区间dp

 1 #include <iostream>
 2 using namespace std;
 3 
 4 int main() {
 5     int T;
 6     cin >> T;
 7     for (int cas = 1; cas <= T; cas++) {
 8         int N;
 9         cin >> N;
10         int a[202], b[202];
11         int dp[202][202];
12         for (int i = 1; i <= N; i++) {
13             cin >> a[i];
14         }
15         for (int i = 1; i <= N; i++) {
16             cin >> b[i];
17         }
18         b[0] = b[N + 1] = 0;
19         for (int i = 1; i <= N; i++) {
20             dp[i][i] = a[i] + b[i - 1] + b[i + 1];
21         }
22         for (int i = 1; i <= N ; i++) {
23             for (int j = 1; j + i <= N ; j++) {
24                 dp[j][j + i] = -1;
25                 for (int k = j; k <= j + i; k++) {
26                     int temp;
27                     if( k==j )
28                         temp = dp[k+1][j+i] + a[k] + b[j+i+1] + b[j-1];
29                     else if( k==i+j )
30                         temp = dp[j][k-1] + a[k] + b[j-1] + b[j+i+1];
31                     else 
32                          temp = dp[j][k-1] + dp[k+1][j + i] + a[k] + b[j-1] + b[j + i + 1];
33                     if (dp[j][j + i] == -1 || temp < dp[j][j + i] ) {
34                         dp[j][j + i] = temp;
35                     }
36                 }
37             }
38         }
39         cout << "Case #" << cas << ": " << dp[1][N] << endl;
40     }
41     return 0;
42 }