1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; string a,b; long long dp[1005][1005]; int main(){ cin>>a>>b; for(int i=0;i<a.size();i++){ for(int j=0;j<b.size();j++){ dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]); if(a[i]==b[j])dp[i+1][j+1]=max(dp[i][j]+1,dp[i+1][j+1]); //cout<<dp[i+1][j+1]<<' '; } //cout<<"\n"; } cout<<dp[a.size()][b.size()]; return 0; }
Information
- ID
- 30
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 4
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By