hdu 1159 解题报告（冷静讨论分析+然后得到推导公式）(51nod 1006) hdu 1503（最长公共子序列+标记路径）

本文详细探讨了如何找到两个字符串的最长公共子序列，介绍了利用二维数组dp进行动态规划的方法，包括状态转移方程，并讨论了在不同情况下的更新规则。此外，还提及了如何通过标记或反向跟踪来获取具体的最长公共子序列。

摘要由CSDN通过智能技术生成

这题与hdu 2604一样都是都需要通过讨论得到推导公式，而推导公式的得来便是解题的关键

hdu 1159

Common Subsequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 48674 Accepted Submission(s): 22392

Problem Description

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. <