HDU Common Subsequence (dp)
来源:互联网 发布:电信网络电视怎么办理 编辑:程序博客网 时间:2024/06/05 02:58
Common Subsequence
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 14 Accepted Submission(s) : 7
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.
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
AC代码:
#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;int main(){ string s1,s2; int dp[500][500]; int i,j,lena,lenb; while(cin>>s1>>s2){ lena=s1.length(); lenb=s2.length(); for(i=0;i<lena;++i)dp[0][i]=0,dp[i][0]=0; for(i=0;i<lena;++i){ for(j=0;j<lenb;++j){ if(s1[i]==s2[j]){ dp[i+1][j+1]=dp[i][j]+1; } else{ dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1]); } //printf("dp[%d][%d]=%d ",i,j,dp[i][j]); } // putchar('\12'); } printf("%d\n",dp[lena][lenb]); } return 0;}
0 0
- HDU Common Subsequence (dp)
- Common Subsequence HDU dp
- HDU 1159 Common Subsequence(还是DP)
- hdu 题目1159 Common Subsequence(DP)
- HDU 1159 Common Subsequence(dp LCS)
- HDU 1159 Common Subsequence (备忘录DP)
- hdu 1159 Common Subsequence(dp)
- hdu 1159 Common Subsequence (dp)
- Hdu oj 1159 Common Subsequence(dp)
- hdu 1599 Common Subsequence(DP)
- HDU 1159 Common Subsequence(基础dp)
- HDU 1159 Common Subsequence【LCS(dp)】
- HDU 1159 Common Subsequence (dp)
- hdu 1159 Common Subsequence #DP
- hdu 1159 Common Subsequence (dp)
- HDU--1159 -- Common Subsequence [DP]
- hdu 1159 Common Subsequence(dp)
- HDU 1159 Common Subsequence (dp)
- HDU 数塔 (dp)
- android studio上传代码到github
- 估算之痛
- 【机房收费系统】——存储过程的应用
- Linux内核中常见内存分配函数
- HDU Common Subsequence (dp)
- jiongjiong.com.cn域名600元被我竞拍到了,嘿嘿
- 关于Android四大组件之一content provicer的详解
- Oracle数据库之PL/SQL异常处理
- 欢迎使用CSDN-markdown编辑器
- iOS时间那点事
- 黑马程序员——java概述及基本语法(一)
- 素数环
- HDU Humble Numbers (dp)