Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <cstring>
- #define NMax 1001
- #define maxim(a,b)((a>b)?a:b)
- using namespace std;
- int M,N;
- char A[NMax],B[NMax];
- int D[NMax][NMax];
- int main(void)
- {
- int i,j;
- freopen("lungimesubsircomunmaximal.in","r",stdin);
- freopen("lungimesubsircomunmaximal.out","w",stdout);
- scanf("%s %s",A,B);
- M=strlen(A);
- N=strlen(B);
- for(i=1;i<=M;++i)
- for(j=1;j<=N;++j)
- if(A[i-1]==B[j-1])
- D[i][j]=1+D[i-1][j-1];
- else
- D[i][j]=maxim(D[i-1][j],D[i][j-1]);
- printf("%d\n",D[M][N]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement