zoukankan      html  css  js  c++  java
  • Poj 1458 Common Subsequence(LCS)

    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, x ij = 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.

    Input

    The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.

    Output

    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
    题意:典型的求最长公共子序列。
    ac代码:
     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<algorithm>
     4 #include<iostream>
     5 using namespace std;
     6 char s1[1000000],s2[1000000];
     7 int vis[500][500];
     8 int main()
     9 {
    10     int i,j,n,m,n1,n2;
    11     while(scanf("%s",s1)!=EOF)
    12     {
    13         n1=0,n2=0;
    14         memset(vis,0,sizeof(vis));
    15         scanf("%s",s2);
    16         n1=strlen(s1);
    17         n2=strlen(s2);
    18         for(i=0; i<n1; i++)
    19         {
    20             for(j=0; j<n2; j++)
    21             {
    22                 if(s1[i]==s2[j])
    23                 {
    24                     vis[i][j]=vis[i-1][j-1]+1;
    25                 }
    26                 else
    27                     vis[i][j]=max(vis[i-1][j],vis[i][j-1]);
    28             }
    29         }
    30         printf("%d
    ",vis[n1-1][n2-1]);
    31     }
    32 }
  • 相关阅读:
    Cannot find the class file for java.lang.Object错误
    JAVA 基础 八种数据类型
    获取转发前的uri与jsp:include的uri
    web 应用获取mybatis sqlSessionFactory 扫描保存的的sqlMapper
    Spring MVC 3 试用笔记——helloworld
    Struts2 Plugin 试用笔记
    JavaScript面试题(评解为原创)
    DataSet的Table筛选多条件情况用法
    每日一帖,记录技术点滴
    行内元素和块级元素的区别
  • 原文地址:https://www.cnblogs.com/Xacm/p/3834088.html
Copyright © 2011-2022 走看看