[动态规划]UVA531 - Compromise

Compromise

In a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not a trivial task for the countries (maybe except for Luxembourg). To enforce that Germany will fulfill the criteria, our government has so many wonderful options (raise taxes, sell stocks, revalue the gold reserves,...) that it is really hard to choose what to do.

Therefore the German government requires a program for the following task:

Two politicians each enter their proposal of what to do. The computer then outputs the longest common subsequence of words that occurs in both proposals. As you can see, this is a totally fair compromise (after all, a common sequence of words is something what both people have in mind).

Your country needs this program, so your job is to write it for us.

Input Specification 

The input file will contain several test cases.

Each test case consists of two texts. Each text is given as a sequence of lower-case words, separated by whitespace, but with no punctuation. Words will be less than 30 characters long. Both texts will contain less than 100 words and will be terminated by a line containing a single '#'.

Input is terminated by end of file.

Output Specification 

For each test case, print the longest common subsequence of words occuring in the two texts. If there is more than one such sequence, any one is acceptable. Separate the words by one blank. After the last word, output a newline character.

Sample Input 

die einkommen der landwirte
sind fuer die abgeordneten ein buch mit sieben siegeln
um dem abzuhelfen
muessen dringend alle subventionsgesetze verbessert werden
#
die steuern auf vermoegen und einkommen
sollten nach meinung der abgeordneten
nachdruecklich erhoben werden
dazu muessen die kontrollbefugnisse der finanzbehoerden
dringend verbessert werden
#

Sample Output 

die einkommen der abgeordneten muessen dringend verbessert werden

题意：给出两个由若干个单词组成的段落，求这两个段落中最长连续子串。。

思路：比较典型的LCS题目了，状态比较简单就能找到。

#include
#include
#include
#include

using namespace std;

vector st1,st2;
int dp[110][110],path[110][110];
int tag;

void printpath(int x,int y)
    {
        if(x==0||y==0) return;
        if(path[x][y]==1)
            {
                printpath(x-1, y-1);
                if(tag==0)
                    {
                        cout<>str)
            {
                st1.clear();
                st2.clear();
                st1.push_back(str);
                while(cin>>str&&str!="#")
                    st1.push_back(str);
                while(cin>>str&&str!="#")
                    st2.push_back(str);
                memset(dp,0,sizeof(dp));
                memset(path,0,sizeof(path));
                int len1=st1.size();
                int len2=st2.size();
                //dp[0][0]=1;
                tag=0;
                for(int i=1;i<=len1;i++)
                    {
                        for(int j=1;j<=len2;j++)
                            {
                                if(st1[i-1]==st2[j-1])
                                    {
                                        dp[i][j]=dp[i-1][j-1]+1;
                                        path[i][j]=1;
                                    }
                                else if(dp[i-1][j]>dp[i][j-1])
                                    {
                                        dp[i][j]=dp[i-1][j];
                                        path[i][j]=2;
                                    }
                                else
                                    {
                                        dp[i][j]=dp[i][j-1];
                                        path[i][j]=3;
                                    }
                            }
                    }
                printpath(len1, len2);
                cout<