hdu--5074--dp

 1 #include <iostream>
 2 #include <cstring>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 int n , m;
 7 const int size = 110;
 8 int a[size];
 9 int score[size][size];
10 int dp[size][size];
11 
12 void solve( )
13 {
14     for( int i = 2 ; i<=n ; i++ )
15     {
16         if( a[i]<=0 )
17         {
18             for( int j = m ; j>=1 ; j-- )
19             {
20                 if( a[i-1]<=0 )
21                 {
22                     for( int k = m ; k>=1 ; k-- )
23                     {
24                         dp[i][j] = max( dp[i][j] , dp[i-1][k] + score[k][j] );
25                     }
26                 }
27                 else
28                 {
29                     dp[i][j] = max( dp[i][j] , dp[i-1][ a[i-1] ] + score[ a[i-1] ][j] );
30                 }
31             }
32         }
33         else
34         {
35             if( a[i-1]<=0 )
36             {
37                 for( int j = m ; j>=1 ; j-- )
38                 {
39                     dp[i][ a[i] ] = max( dp[i][ a[i] ] , dp[i-1][j] + score[j][ a[i] ] );
40                 }
41             }
42             else
43             {
44                 dp[i][ a[i] ] = max( dp[i][ a[i] ] , dp[i-1][ a[i-1] ] + score[ a[i-1] ][ a[i] ] );
45             }
46         }
47     }
48 }
49 
50 int main()
51 {
52     cin.sync_with_stdio(false);
53     int t;
54     int ans;
55     cin >> t;
56     while( t-- )
57     {
58         memset( dp , 0 , sizeof(dp) );
59         ans = 0;
60         cin >> n >> m;
61         for( int i = 1 ; i<=m ; i++ )
62         {
63             for( int j = 1 ; j<=m ; j++ )
64             {
65                 cin >> score[i][j];
66             }
67         }
68         for( int i = 1 ; i<=n ; i++ )
69         {
70             cin >> a[i];
71         }
72         solve( );
73         for( int i = 1 ; i<=n ; i++ )
74         {
75             ans = max( dp[n][i] , ans );
76         }
77         cout << ans << endl;
78     }
79     return 0;
80 }