poj 1458 Common Subsequence

简单的动态规划

#include <iostream>#include <string>using namespace std;int dp[500][500];string s,t;int max(int a, int b){ return a>=b?a:b;}int lcs(){ int i,j; for(i=1;i<=s.size();i++){  for(j=1;j<=t.size();j++){   if(s[i-1]==t[j-1]){    dp[i][j]=dp[i-1][j-1]+1;   }   else{    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);       }  } } return dp[s.size()][t.size()];}int main(){ while(cin>>s>>t){  memset(dp,0,sizeof(dp));  cout<<lcs()<<endl; } system("PAUSE"); return 0;}