Advertisement
Guest User

Untitled

a guest
Nov 28th, 2014
184
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.91 KB | None | 0 0
  1. #include <iostream>
  2. #include <string>
  3.  
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8. string saaa1,s2aa,asdasd;
  9. int ** Lasdfas,i,j,m,n;
  10.  
  11. getline(cin,saaa1, ' ' );
  12. getline(cin,s2aa);
  13.  
  14. m = saaa1.length();
  15. n = s2aa.length();
  16.  
  17. Lasdfas = new int * [m + 1];
  18. for(i = 0; i <= m; i++) Lasdfas[i] = new int[n + 1];
  19.  
  20. for(i = 0; i <= m; i++) Lasdfas[i][0] = 0;
  21. for(j = 0; j <= n; j++) Lasdfas[0][j] = 0;
  22. for(i = 0; i < m; i++)
  23. for(j = 0; j < n; j++)
  24. if(saaa1[i] == s2aa[j])
  25. Lasdfas[i + 1][j + 1] = 1 + Lasdfas[i][j];
  26. else
  27. Lasdfas[i + 1][j + 1] = max(Lasdfas[i + 1][j],Lasdfas[i][j + 1]);
  28.  
  29.  
  30. asdasd = ""; i = m - 1; j = n - 1;
  31. while((i >= 0) && (j >= 0))
  32. if(saaa1[i] == s2aa[j])
  33. {
  34. asdasd = saaa1[i] + asdasd;
  35. i--; j--;
  36. }
  37. else if(Lasdfas[i + 1][j] > Lasdfas[i][j + 1]) j--;
  38. else i--;
  39. cout << Lasdfas[m][n];
  40. return 0;
  41. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement