题目大意:
你想要去旅游,爸爸妈妈给了你意见,你为了不让他们伤心,你要尽可能的满足他们给的意见。
思路:最长公共子序列
字符串中可以有空格
代码:
#include <iostream>
using namespace std;
#include <cstring>
#include <stdio.h>
string s1,s2;
int d[105][105];
int main() {
int T = 1;
while(getline(cin,s1)) {
if(s1[0] == '#')
break;
getline(cin,s2);
memset(d,0,sizeof(d));
int len1 = s1.length();
int len2 = s2.length();
for(int i = 1; i <= len1; i++) {
for(int j = 1; j <= len2; j++) {
if(s1[i - 1] == s2[j - 1]) {
d[i][j] = d[i - 1][j - 1] + 1;
}
else {
d[i][j] = max(d[i - 1][j],d[i][j - 1]);
}
}
}
printf("Case #%d: you can visit at most %d cities.\n",T++,d[len1][len2]);
}
return 0;
}