HDU - 1159(LCS)

本文介绍了一个寻找两个字符串之间最长公共子序列的算法问题,给出了AC代码实现。程序读取输入文件中的两组字符串,通过动态规划计算它们的最大公共子序列长度,并在标准输出中打印结果。示例输入和输出展示了算法的正确性。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Common Subsequence

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, …, xm> another sequence Z = <z1, z2, …, zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, …, ik> of indices of X such that for all j = 1,2,…,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
Input
abcfbc abfcab
programming contest
abcd mnp
Output
4
2
0
Sample Input
abcfbc abfcab
programming contest
abcd mnp
Sample Output
4
2
0

前言:

char a[100];
scanf("%s",a+1); //表示从数组a的首地址+1开始输入
cin>>a+1; //使用cin也可以这样写

AC代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<cmath>
char s[1050],f[1050];
int dp[1050][1050];
using namespace std;
int main()
{
	
	while(~scanf("%s %s",s+1,f+1))
	{	
		int l1=strlen(s+1);
		int l2=strlen(f+1);
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=l1;i++)
		{
			for(int j=1;j<=l2;j++)
			{
				if(s[i]==f[j])
				dp[i][j]=dp[i-1][j-1]+1;
				else
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
			}
		} 
		printf("%d\n",dp[l1][l2]);
	}
 	return 0;
}

可根据这个表看状态转移方程

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值