Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- string s1,s2;
- int main()
- {
- int i,j,k,ans,len1,len2;
- while(cin>>s1>>s2)
- {
- len1=s1.length();
- len2=s2.length();
- int dp[len1+5][len2+5];
- memset(dp,0,sizeof(dp));
- for(i=0;i<=len1;i++)
- {
- for(j=0;j<=len2;j++)
- {
- if(i==0||j==0)
- dp[i][j]=0;
- else if(s1[i-1]==s2[j-1])
- dp[i][j]=dp[i-1][j-1]+1;
- else
- dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
- }
- }
- /* for(i=0;i<=len1;i++)
- {
- for(j=0;j<=len2;j++)
- cout<<dp[i][j]<<" ";
- cout<<endl;
- }
- */
- cout<<dp[len1][len2]<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement