10066专题

uva 10066 LCS

题意: 最长公共子序列。 代码: #include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <cstring>#include <cmath>#include <stack>#include <vector>#include <queue>#include

【UVA】10066-The Twin Towers(最长公共子串问题)

赤裸裸的最长公共子串问题,没什么好说的,注意的是,每组数据后面都有一个空行。 13996019 10066 The Twin Towers Accepted C++ 0.015 2014-08-06 00:34:53 #include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using

uva 10066 The Twin Towers(动态规划:LCS)

水题一道 代码如下: #include <cstdio>#include <cstring>#include <algorithm>#define MAXN 110using namespace std;int a[MAXN], b[MAXN];int dp[MAXN][MAXN];int main(void) {int len1, len2, t;t = 1;while(sca

uva 10066 The Twin Towers

题意:最长公共子序列。 #include <iostream>#include <cstdio>#include <cstring>using namespace std;const int N=105;int main(){int n,m,t_cnt=0,a[N],b[N],map[N][N];while(scanf("%d%d",&n,&m)!=EOF){if(n==0&&m