ZOJ 1642 Match for Bonus （DP）

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <string>
 4 #include <string.h>
 5 
 6 using namespace std;
 7 
 8 int a[3101] ;
 9 int dp[3101][3101] ;
10 int s ;
11 char ch ;
12 string sh1,sh2 ;
13 
14 int main()
15 {
16     int n ;
17     while(cin >> n)
18     {
19         for(int i = 0 ; i < n ; i++)
20         {
21             cin >> ch >> s;
22             a[int(ch)] = s ;
23         }
24         cin >> sh1 >> sh2 ;
25         memset(dp,0,sizeof(dp)) ;
26         for(int i = 1 ; i <= sh1.size() ; i++)
27             for(int j = 1 ; j <= sh2.size() ; j++)
28         {
29             dp[i][j] = max(dp[i-1][j],dp[i][j-1]) ;
30             if(sh1[i-1] == sh2[j-1])
31                 dp[i][j] = max(dp[i][j],dp[i-1][j-1]+a[int(sh1[i-1])]) ;
32         }
33          printf("%d\n",dp[sh1.size()][sh2.size()]) ;
34     }
35     return 0;
36 }