HDU Common Subsequence

简介:

Common Subsequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 182 Accepted Submission(s): 109
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.
 
Sample Input
abcfbc abfcab
programming contest 
abcd mnp
 
Sample Output
4
2
0

#include <iostream>
using namespace
std;
int
main()
{

    string a,b;
    int
i,j;
    int
c[500][500],al,bl;
    while
(cin>>a>>b)
    {

        al = a.length();
        bl = b.length();
        for
(i = 0; i < al ; i++)

        c[i][0] = 0;
        for
(i = 0; i < bl ; i++)

        c[0][i] = 0;
        for
(i = 0;i < al; i++)
        for
(j = 0;j < bl; j++)
        {

            if
(a[i]==b[j])c[i+1][j+1] = c[i][j]+1;
            else

            {

               c[i+1][j+1] = (c[i][j+1]>=c[i+1][j]?c[i][j+1]:c[i+1][j]);
            }
        }

        cout<<c[i][j]<<endl;
    }
}













相关文章
|
6月前
|
人工智能
HDU-1159-Common Subsequence
HDU-1159-Common Subsequence
33 0
|
6月前
poj-1458-Common Subsequence
poj-1458-Common Subsequence
30 0
|
6月前
Strange fuction(HDU--2899)
Strange fuction(HDU--2899)
POJ-1458,Common Subsequence(经典DP)
POJ-1458,Common Subsequence(经典DP)
# Leetcode 14:Longest Common Prefix 最长公共前缀
公众号:爱写bug Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". 编写一个函数来查找字符串数组中的最长公共前缀。
998 0
[LeetCode]Longest Common Prefix 最长公共前缀
链接:https://leetcode.com/problems/longest-common-prefix/#/description难度:Easy题目:14. Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings.翻译:编写一个函数来查找给定字符串数组中最长的公共前缀。
944 0