zoj1642 Match for Bonus(DP)
/*
简单DP：裸的最大公共子序列
*/
View Code
1 #include <iostream>
2 #include <cstdlib>
3 #include <cstring>
4
5 using namespace std;
6
7 int CtoI( char ch )
8 {
9 if ( ch >= 'a' && ch <= 'z' )
10 return ch - 'a';
11 else return ch - 'A' + 26;
12 }
13
14 int Value[ 54 ];
15
16 char A[ 2001 ],B[ 2001 ];
17 short LCS[ 2001 ][ 2001 ];
18
19 int main()
20 {
21 int n,v;char c;
22 while ( cin >> n ) {
23 for ( int i = 0 ; i < n ; ++ i ) {
24 cin >> c >> v;
25 Value[ CtoI( c ) ] = v;
26 }
27 cin >> A >> B;
28 int A_Len = strlen( A );
29 int B_Len = strlen( B );
30 memset( LCS, 0, sizeof( LCS ) );
31 for ( int i = 1 ; i <= A_Len ; ++ i )
32 for ( int j = 1 ; j <= B_Len ; ++ j ) {
33 LCS[ i ][ j ] = max( LCS[ i-1 ][ j ], LCS[ i ][ j-1 ] );
34 if ( A[ i-1 ] == B[ j-1 ] && LCS[ i ][ j ] < LCS[ i-1 ][ j-1 ] + Value[ CtoI( A[ i-1 ] ) ] )
35 LCS[ i ][ j ] = LCS[ i-1 ][ j-1 ] + Value[ CtoI( A[ i-1 ] ) ];
36 }
37 cout << LCS[ A_Len ][ B_Len ] << endl;
38 }
39 return 0;
40 }
