文章
6
粉丝
105
获赞
2
访问
3.8k
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int dp[1011][1011];
int max(int a, int b) {
return (a > b) ? a : b;
}
int main()
{
string a, b;
while (cin >> a)
{
cin >> b;
int lena = a.size();
int lenb = b.size();
//dp[1000][1000] = { 0 };
memset(dp, 0, sizeof(dp));
int ans = 0;
int ii=0;
for (int i = 1; i <= lena; i++) {
for (int j = 1; j <= lenb; j++) {
if (a[i - 1] == b[j - 1])
&n...
登录后发布评论
暂无评论,来抢沙发