Hdu1159 Common Subsequence(简单递归)

Hdu1159 Common Subsequence

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

遇到了一个神奇的错误 C2679 大概是说>>string不能用，给了个CE

后来发现是没有加头文件#include<string>

#include <iostream>
#include<map>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<string>
#define ll long long
using namespace std;
const int N=10005;
int dp[N][N];
string s1,s2;
int main()
{
  while(cin>>s1>>s2){
        int len1=s1.length();
        int len2=s2.length();
        for(int i=0;i<=len1;i++)
            for(int j=0;j<=len2;j++)
                dp[i][j]=0;
        for(int i=1;i<=len1;i++){
            for(int j=1;j<=len2;j++){
                if(s1[i-1]==s2[j-1])
                    dp[i][j]=dp[i-1][j-1]+1;
                else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            }
        }
        cout<<dp[len1][len2]<<endl;
  }
}