zoukankan      html  css  js  c++  java
  • Common Subsequence

    Common Subsequence

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
    Total Submission(s) : 32   Accepted Submission(s) : 16

    Font: Times New Roman | Verdana | Georgia

    Font Size:

    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
    

    Source

    Southeastern Europe 2003

    #include <iostream>
    #include<string>
    using namespace std;
    char d[1000],p[1000];
    int a[1000][1000];

    int main()
    {int i,j,d2,d1;
        while(cin>>d>>p)
        {d1=strlen(d);
        d2=strlen(p);
    for(i=0;i<d1;i++)
    for(j=0;j<d2;j++)
    a[i][j]=0;
            for(i=1;i<strlen(d)+1;i++)
    for(j=1;j<strlen(p)+1;j++)
    {if(d[i-1]==p[j-1])
    a[i][j]=a[i-1][j-1]+1;
    else
    a[i][j]=a[i-1][j]>a[i][j-1]?a[i-1][j]:a[i][j-1];

    }


    cout<<a[d1][d2]<<endl;

        }
        return 0;
    }

  • 相关阅读:
    GO 爬虫图片相关
    GO 爬虫链接
    Redis使用
    HTTP请求
    lris框架基础案例
    UDP通信功能
    C++随机
    matplotlib显示指数部分的负号
    使用opencv-python读取中文路径图片
    pytorch模型可视化,torchviz,tensorboardX,文本方式
  • 原文地址:https://www.cnblogs.com/lengxia/p/4387865.html
Copyright © 2011-2022 走看看