poj1934 Trip【线性DP】【输出方案】

Trip

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3850		Accepted: 1030

Description

Alice and Bob want to go on holiday. Each of them has planned a route, which is a list of cities to be visited in a given order. A route may contain a city more than once. 
As they want to travel together, they have to agree on a common route. None wants to change the order of the cities on his or her route or add other cities. Therefore they have no choice but to remove some cities from the route. Of course the common route should be as long as possible. 
There are exactly 26 cities in the region. Therefore they are encoded on the lists as lower case letters from 'a' to 'z'.

Input

The input consists of two lines; the first line is Alice's list, the second line is Bob's list. 
Each list consists of 1 to 80 lower case letters with no spaces inbetween.

Output

The output should contain all routes that meet the conditions described above, but no route should be listed more than once. Each route should be printed on a separate line. There is at least one such non-empty route, but never more than 1000 different ones. Output them in ascending order.

Sample Input

abcabcaa
acbacba

Sample Output

ababa
abaca
abcba
acaba
acaca
acbaa
acbca

Source

CEOI 2003

题意：

求最长公共子序列，要求输出所有方案。

思路：

最长公共子序列好求，难点在输出方案。

用dp[i][j]表示处理到alice[i]和bob[j]时的最优解。如果alice[i]bob[j]不相等，dp[i][j]从dp[i-1][j], dp[j][i-1]中取较大的。相等，则dp[i-1][j-1]+1

先得到最优解，然后我们来输出所有方案。排序和去重都简单，用个set就行了。

首先我们预处理出alice串1~i的子串中，字符j+'a'最后一次出现的位置，存入pos1[i][j]。对bob串也做同样的处理。

然后我们进行递归。len1表示alice子串长度，len2表示bob子串长度，len表示公共串的子串长度。

枚举26个字母，找到他们在子串中最后出现的位置，如果我们发现dp[p1][p2] = len，那么说明这是一种可行的方案。并且这表示，这个字母会出现在这个方案的len位置。于是我们继续递归，去找(len1-1，len2-1,len-1)。直到len小于0了，说明现在当前跑出来的这个串跑完了，他是一个完整的方案，insert进set。如果在len到0之前，len1或者len2就已经小于0了，说明这个方案最后不可行了，也就不会insert，而会回溯。整个过程相当于是一个dfs。

WA了一次是因为输出了一下方案数的个数.....

 //#include <bits/stdc++.h>
 #include<iostream>
 #include<cmath>
 #include<algorithm>
 #include<stdio.h>
 #include<cstring>
 #include<vector>
 #include<map>
 #include<set>

 #define inf 0x3f3f3f3f
 using namespace std;
 typedef long long LL;

 char alice[], bob[], tmp[];
 int dp[][], pos1[][], pos2[][];
 set<string> ans;
 int lena, lenb;

 void solve(int len1, int len2, int len)
 {
     if(len <= ){
         string str;
         str = tmp + ;
         //memset(tmp, 0, sizeof(tmp));
         //cout<<str<<endl;
         ans.insert(str);
         return;
     }
     if(len1 >  && len2 > ){
         for(int i = ; i < ; i++){
             int p1 = pos1[len1][i];
             int p2 = pos2[len2][i];
             if(dp[p1][p2] == len){
                 tmp[len] = i + 'a';
                 solve(p1 - , p2 - , len - );
             }
         }
     }

 }

 int main()
 {
     while(scanf("%s%s", alice + , bob + ) != EOF){
         lena = strlen(alice + );
         lenb = strlen(bob + );
         //ans.clear();

         for(int i = ; i <= lena; i++){
             dp[i][] = ;
         }
         for(int j = ; j <= lenb; j++){
             dp[][j] = ;
         }

         int tmpi = -, tmpj = -;
         for(int i = ; i <= lena; i++){
             for(int j = ; j <= lenb; j++){
                 dp[i][j] = max(dp[i][j], dp[i - ][j]);
                 dp[i][j] = max(dp[i][j], dp[i][j - ]);
                 if(alice[i] == bob[j]){
                     dp[i][j] = dp[i - ][j - ] + ;
                 }
             }
         }

         memset(pos1, -, sizeof(pos1));
         memset(pos2, -, sizeof(pos2));
         for(int i = ; i <= lena; i++){
             for(int j = ; j < ; j++){
                 if(alice[i] == j +'a'){
                     pos1[i][j] = i;
                 }
                 else{
                     pos1[i][j] = pos1[i - ][j];
                 }
             }
         }
         for(int i = ; i <= lenb; i++){
             for(int j = ; j < ; j++){
                 if(bob[i] == j + 'a'){
                     pos2[i][j] = i;
                 }
                 else{
                     pos2[i][j] = pos2[i - ][j];
                 }
             }
         }

         //printf("%d\n", dp[lena][lenb]);
         memset(tmp, , sizeof(tmp));
         solve(lena, lenb, dp[lena][lenb]);
         set<string>::iterator iter;
         for(iter = ans.begin(); iter != ans.end(); iter++){
             cout<<*iter<<endl;
         }

     }

     return ;
 }