hdu 1159 Common Subsequence
来源:互联网 发布:淘宝会员吸纳打标 编辑:程序博客网 时间:2024/05/22 07:39
/*http://acm.hdu.edu.cn/showproblem.php?pid=1159动态规划dp[i][j] 表示 对于 字符串x前i 个字符 和字符串y 的前 j 个字符的最大相同子串初始值:dp[0][0]=dp[0][1]=dp[1][0]=0对于 i ,j 如果 x[i]==x[y] 则 dp[i][i]=dp[i-1][j-1]如果x[i]!=y[j] 则 dp[i][j]=max{dp[i-1][j],dp[i][j-1]} */#include <stdio.h>#include <string.h>int dp[1000][1000];int main(){freopen("input.txt","r",stdin);char x[1000],y[1000];while(scanf("%s %s",x,y)!=EOF){int lx = strlen(x);int ly = strlen(y);int i,j;dp[0][0]=0;dp[1][0]=0;dp[0][1]=0;for(i=1;i<=lx; i++) //要 <= {for(j=1; j<=ly; j++) //要 <= {if(x[i-1]==y[j-1])//字符串x,y的第一个字符是从 0 开始的{dp[i][j]=dp[i-1][j-1]+1;}elsedp[i][j]=dp[i-1][j]>dp[i][j-1]?dp[i-1][j]:dp[i][j-1];}}printf("%d\n",dp[i-1][j-1]);}return 0;}
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- Common Subsequence hdu 1159
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- [小说]魔王冢(33)孟婆汤
- Win7卸载了FrameWork4.0后,再重装Framework4.0,vs2010显示“此计算机上没有安装.NETFramework,Version=v4.0”
- 睡觉睡硬床板的好处
- 第三方过滤器在TVideoGrabber中的使用
- .NET下 webdriver的基本操作总结
- hdu 1159 Common Subsequence
- C++ Boost库 asio同步/异步模式[ 定时器来体现 ] [大三四八九月实习]
- mysql alter语句增加一列
- 黑马程序员——面试重点之内存泄露
- hibernate4.2.4之环境搭建与测试实例
- 《JAVA课程设计》笔记-四章
- HTTP深入浅出 http请求
- POJ--3250 -- Bad Hair Day [栈模拟]
- WPF 数据绑定详解。。。