POJ 2250

 #include <iostream>
 #include <stack>
 #define MAXN 150
 #include <string>

 using namespace std;

 int dp[MAXN][MAXN];
 int mark[MAXN][MAXN];
 string s_1[MAXN];
 string s_2[MAXN];
 stack <string> coll;

 int main()
 {
     int i;
     int j;
     string tem;
     int n_1;
     int n_2;
     //freopen("acm.acm","r",stdin);
     while(cin>>tem)
     {
         s_1[] = tem;
         i = ;
         while(cin>>tem)
         {
             if(tem == "#")
             {
                 break;
             }
             s_1[i ++] = tem;
         }
         n_1 = i;
         i = ;
         while(cin>>tem)
         {
             if(tem == "#")
             {
                 break;
             }
             s_2[i ++] = tem;
         }
         n_2 = i;
         dp[][] = ;
         for(i = ; i <= n_1; ++ i)
         {
             dp[i][] = ;
         }
         for(i = ; i <= n_2; ++ i)
         {
             dp[][i] = ;
         }
         memset(mark,-,sizeof(mark));
         for(i = ; i < n_1; ++ i)
         {
             for(j = ; j < n_2; ++ j)
             {
                 if(s_1[i] == s_2[j])
                 {
                     dp[i+][j+] = dp[i][j] + ;
                     mark[i][j] = ;    //相等来自i-1和j-1
                 }
                 else
                 {
                     if(dp[i+][j] > dp[i][j+])
                     {
                         dp[i+][j+] = dp[i+][j];
                         mark[i][j] = ;  // j-1方向
                     }
                     else
                     {
                         dp[i+][j+] = dp[i][j+];
                         mark[i][j] = ; // i-1方向
                     }
                 }
             }
         }

         i = n_1-;
         j = n_2-;

         while(mark[i][j] != - && j >=  && i >= )
         {
             if(mark[i][j] == )
             {
                 coll.push(s_1[i]);
                 -- i;
                 -- j;
             }
             else if(mark[i][j] == )
             {
                 -- j;
             }
             else if(mark[i][j] == )
             {
                 -- i;
             }
         }

         while(!coll.empty())
         {
             cout<<coll.top()<<" ";
             coll.pop();
         }
         cout<<endl;
     }

 }

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。

技术网站地址： vmfor.com