Common Subsequence 1458 pku
来源:互联网 发布:最优化算法第二版答案 编辑:程序博客网 时间:2024/06/05 04:35
#include<iostream>
#include<string.h>
using namespace std;
int exportMax(int a,int b)
{
return a>b? a:b;
}
int opt[1010][1010];
int main()
{
char str1[1010],str2[1010];
while(cin>>str1+1>>str2+1)
{
int len1=strlen(str1+1);
int len2=strlen(str2+1);
memset(opt,0,sizeof(opt));
for(int i=1;i<=len1;i++)
{
for(int j=1;j<=len2;j++)
{
if(str1[i]==str2[j])
{
opt[i][j]=opt[i-1][j-1]+1;
}
else
{
opt[i][j]=exportMax(opt[i-1][j],opt[i][j-1]);
}
}
}
cout<<opt[len1][len2]<<endl;
}
}
- pku 1458 Common Subsequence
- Common Subsequence 1458 pku
- Common Subsequence 1458 pku
- Common Subsequence(PKU 1458)
- Pku acm 1458 Common Subsequence
- PKU 1458 HDOJ 1159 Common Subsequence
- Pku acm 1458 Common Subsequence 题意分析
- Pku acm 1458 Common Subsequence 动态规划解析
- PKU-1458 Common Subsequence (最长公共子序列LCS)
- Pku acm 1458 Common Subsequence 动态规划题目解题报告(五)
- Pku acm 1458 Common Subsequence 动态规划解析 2d1d问题
- Common Subsequence--poj--1458
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- Poj 1458 Common Subsequence
- POJ 1458 Common Subsequence
- poj 1458 Common Subsequence
- poj 1458 Common Subsequence
- Linux下的select封装(暂时只对socket)
- vc 入门
- pku 1226 Substrings
- 1976年 比尔·盖茨写给电脑爱好者的公开信
- Linux缺页中断处理
- Common Subsequence 1458 pku
- vc的学习方法(转)
- CWinThread类
- Knight Moves pku 1915
- 系统封装语音教程和软件封装
- 系统封装语音教程和软件封装
- Oil Deposits pku 1562
- 第二天实习
- pku 1011 sticks