HDOJ 1159 Common Subsequence 杭电 ACM
2013-07-16 16:32
344 查看
方法在老刘的PPT里已经给出
该代码在G++环境下AC 否则会停止编译 稍改可适应其他环境
#include<iostream>
using namespace std;
int i,j,xl,yl,f[1001][1001]={0};
int main(){
string x,y;
while(cin>>x>>y){
xl=x.length(),yl=y.length();
for(i=1;i<=xl;++i)
for(j=1;j<=yl;++j)
f[i][j]=x[i-1]-y[j-1]?max(f[i-1][j],f[i][j-1]):f[i-1][j-1]+1;
cout<<f[xl][yl]<<endl;
}
}
该代码在G++环境下AC 否则会停止编译 稍改可适应其他环境
#include<iostream>
using namespace std;
int i,j,xl,yl,f[1001][1001]={0};
int main(){
string x,y;
while(cin>>x>>y){
xl=x.length(),yl=y.length();
for(i=1;i<=xl;++i)
for(j=1;j<=yl;++j)
f[i][j]=x[i-1]-y[j-1]?max(f[i-1][j],f[i][j-1]):f[i-1][j-1]+1;
cout<<f[xl][yl]<<endl;
}
}
相关文章推荐
- 杭电acm 1159Common Subsequence(字符串处理+dp)
- HDOJ1159 Common Subsequence(dp)
- 动态规划—杭电1159 Common Subsequence
- HDOJ1159(Common Subsequence)
- hdoj 1159 Common Subsequence 【最大连续子序列】
- HDOJ 1159 Common Subsequence【模板题】
- HDOJ 1159 Common Subsequence(最长公共子序列)
- HDOJ --- 1159 Common Subsequence
- HDOJ_ACM_Common Subsequence
- 杭电1159(Common Subsequence)LCS和dp
- POJ 1458 || HDOJ 1159 Common Subsequence (DP)
- 杭电1159——Common Subsequence
- 杭电1159Common Subsequence
- hdoj 1159 Common Subsequence 【LCS】
- 杭电-1159Common Subsequence(LCS)
- 字符串 并且 动态规划练习二:HDU ACM 1159 Common Subsequence
- HDOJ 1159:Common Subsequence
- HDOJ--1159--Common Subsequence(lcs算法)
- HDOJ1159 Common Subsequence
- 杭电 HDU ACM 1159 Common Subsequence