Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n,k,i,j;
- string a,b;
- cin>>a>>b;
- n=a.length();
- k=b.length();
- int lcs[n+1][k+1];
- for(i=0;i<=n;i++)
- {
- lcs[i][0]=0;
- }
- for(j=0;j<=k;j++)
- {
- lcs[0][j]=0;
- }
- for(i=1;i<=n;i++)
- {
- for(j=1;j<=k;j++)
- {
- if(b[j-1]==a[i-1])
- {
- lcs[i][j]=lcs[i-1][j-1]+1;
- }
- else
- {
- lcs[i][j]=max(lcs[i][j-1],lcs[i-1][j]);
- }
- }
- }
- for(i=0;i<=n;i++)
- {
- for(j=0;j<=k;j++)
- {
- cout<<lcs[i][j]<<" ";
- }
- cout<<endl;
- }
- cout<<lcs[n][k]<<endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement