Advertisement
Zinak

LCS

Jul 27th, 2019
136
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.53 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int lcs(string a,string b,int c,int d)
  4. {
  5.     int len[c+5][d+5];
  6.     for (int i = 0; i <= c; i++)
  7.     {
  8.     for (int j = 0; j<= d; j++)
  9.     {
  10.     if (i==0 || j==0)
  11.     len[i][j] = 0;
  12.     else if (a[i-1] == b[j-1])
  13.     len[i][j]=1 + len[i-1][j-1];
  14.     else
  15.     len[i][j]=max(len[i-1][j],len[i][j-1]);
  16.  
  17. }
  18. }
  19. return len[c][d];
  20. }
  21.     int main()
  22.     {
  23.     string a,b;
  24.     int c,d;
  25.     cin>>a>>b;
  26.     c=a.size();
  27.     d=b.size();
  28.     cout<<lcs(a,b,c,d)<<endl;
  29.  
  30.     return 0;
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement