【HDU 1159】Common Subsequence （动态规划）

  
  

   
   

    
    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
   
   

  
  

#include<cstdio>
#include<algorithm>
#include<stack>
#include<string.h>
using namespace std;
char str1[1005],str2[1005];
int dp[1005][1005];
int main()
{
	
	while(scanf("%s %s",str1+1,str2+1)!=EOF)
	{
		memset(dp,0,sizeof(dp));
		str1[0]='0';
		str2[0]='0';
		int a1=strlen(str1)-1;
		int a2=strlen(str2)-1;
		for(int i=1;i<=a1;i++)
		{
			for(int j=1;j<=a2;j++)
			if(str1[i]==str2[j])
			dp[i][j]=dp[i-1][j-1]+1;
			else
			dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
		}
	/*	int pos1=a1;      //如果题目要求将最长公共子序列的字母依次写出来，
		int pos2=a2;         便用上这段代码   
		stack<char>s;
		while(pos1>0&&pos2>0)
		{
		if(str1[pos1]==str2[pos2])
	{
		s.push(str1[pos1]);
		pos1--;
		pos2--;
	}
		else if (dp[pos1-1][pos2]>dp[pos1][pos2-1])
		pos1--;
		else
		pos2--;
	}
	while(!s.empty())
	{
		printf("%c%c",s.top(),(s.size()!=1)? ' ':'\n' );
		s.pop();
	}
	*/


		printf("%d\n",dp[a1][a2]);
	}
	
	
	
	
	return 0;
}