HDU 1159 Common Subsequence (LCS)
来源:互联网 发布:怎么申请免费的域名 编辑:程序博客网 时间:2024/05/22 01:36
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38474 Accepted Submission(s): 17654
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.
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 abfcabprogramming contest abcd mnp
Sample Output
420
Source
Southeastern Europe 2003
LCS 模板题。
#include <iostream>#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>using namespace std;#define ll long longint dp[1000][1000];int main(){ char a[1000],b[1000]; while(~scanf("%s%s",a+1,b+1)) { memset(dp,0,sizeof dp); int l1=strlen(a); int l2=strlen(b); for(int i=1;i<l1;i++) { for(int j=1;j<l2;j++) { if(a[i]==b[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-1][l2-1]); } return 0;}
阅读全文
0 0
- hdu 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence(LCS)
- HDU 1159 Common Subsequence【LCS】
- hdu 1159 Common Subsequence (lcs)
- hdu 1159 Common Subsequence(lcs)
- HDU-1159-Common Subsequence【LCS】
- HDU 1159 Common Subsequence(LCS)
- HDU 1159 Common Subsequence(LCS)
- HDU 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence (动态规划LCS)
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence 【LCS 基础入门】
- hdu 1159 && poj 1458 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(DP,LCS)
- hdu 1159 Common Subsequence(LCS,dp)
- HDU - 1159 Common Subsequence (简单LCS)
- HDU 1159 Common Subsequence(dp LCS)
- centos7 hadoop 配置ssh
- 通信方式--信号量的操作
- typedef float V __attribute__((vector_size(16)));的含义
- ssh框架搭建(注解)
- crontab和anacron和logrotate的关系详解
- HDU 1159 Common Subsequence (LCS)
- Zabbix 系列博客教程目录
- Android的事件传递机制
- Kotlin学习资料汇总
- Java基础day01
- HBuilder配置自动编译Less(包含less-plugin-functions)
- Python 读写excel
- 写给Android App开发人员看的Android底层知识(2)(转自包老师)
- ios::sync_with_stdio(false);