poj2250 Compromise dp lcs 레코드 경로
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 5045
Accepted: 2297
Special Judge
Description
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
The input 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
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
Source
Ulm Local 1997
#include<iostream>
#include<cstdlib>
#include<string>
#include<memory.h>
using namespace std;
string a[110];
string b[110];
string c[110];
int dp[110][110];
int d[110][110];
int main()
{
int l1,l2;
while(cin>>a[1])
{
l1=2;
while(a[l1-1]!="#")
cin>>a[l1++];
l1-=2;
cin>>b[1];
l2=2;
while(b[l2-1]!="#")
cin>>b[l2++];
memset(dp,0,sizeof(dp));
memset(d,0,sizeof(d));
for(int i=1;i<=l1;i++)
for(int j=1;j<=l2;j++)
{
if(a[i]==b[j])
dp[i][j]=dp[i-1][j-1]+1,d[i][j]=3;
else
{
if(dp[i-1][j]>dp[i][j-1])
dp[i][j]=dp[i-1][j],d[i][j]=2;
else
dp[i][j]=dp[i][j-1],d[i][j]=1;
}
}
int n=dp[l1][l2];
int i=l1;
int j=l2;
while(n)
{
while(d[i][j]!=3)
{
if(d[i][j]==2)
i--;
else j--;
}
n--;
c[n]=a[i];
i--;j--;
}
cout<<c[0];
for(int k=1;k<dp[l1][l2];k++) cout<<" "<<c[k];
cout<<endl;
}
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
Access Request, Session and Application in Struts2If we want to use request, Session and application in JSP, what should we do? We can obtain Map type objects such as Req...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.