forked from SharmaManish/Spoj
-
Notifications
You must be signed in to change notification settings - Fork 0
/
TRIP.cpp
122 lines (89 loc) · 3.16 KB
/
TRIP.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include<iostream>
#include<stdio.h>
#include<set>
#include<iterator>
using namespace std;
void print(set<string> s)
{
set<string>::iterator it;
for(it=s.begin();it!=s.end();it++)
{
cout<<*it<<endl;
}
}
void LCS(string x,int m,string y,int n)
{
int c[m+1][n+1];
set<string> s[m+1][n+1];
for(int i=0;i<=m;i++)
{
c[i][0]=0;
s[i][0].insert("");
}
for(int j=0;j<=n;j++)
{
c[0][j]=0;
s[0][j].insert("");
}
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
{
if(x[i-1]==y[j-1])
{
c[i][j]=c[i-1][j-1]+1;
set<string>::iterator it;
for(it=s[i-1][j-1].begin();it!=s[i-1][j-1].end();it++)
{
s[i][j].insert((*it)+x[i-1]);
}
}
else if(c[i-1][j]>c[i][j-1])
{
c[i][j]=c[i-1][j];
set<string>::iterator it;
for(it=s[i-1][j].begin();it!=s[i-1][j].end();it++)
{
s[i][j].insert((*it));
}
}
else if(c[i][j-1]>c[i-1][j])
{
c[i][j]=c[i][j-1];
set<string>::iterator it;
for(it=s[i][j-1].begin();it!=s[i][j-1].end();it++)
{
s[i][j].insert((*it));
}
}
else
{
c[i][j]=c[i][j-1];
set<string>::iterator it;
for(it=s[i][j-1].begin();it!=s[i][j-1].end();it++)
{
s[i][j].insert((*it));
}
for(it=s[i-1][j].begin();it!=s[i-1][j].end();it++)
{
s[i][j].insert((*it));
}
}
}
print(s[m][n]);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
string x;
string y;
cin>>x>>y;
int m=x.length();
int n=y.length();
LCS(x,m,y,n);
}
system ("pause");
return 0;
}