动态规划(四种DP算法)
for(i=1;i<=n;i++)
dp[i]=1;
for(i=1;i<=n;1++)
for(j=1;j<=i-1;j++)
{
if(a[i]>a[j])
dp[i]=max(dp[i],dp[j]+1);
}
------------------------------------------------------
if(x[i]==y[j])
dp[i][j]=dp[i-1][j-1]+1;
if(x[i]!=y[j])
dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
------------------------------------------------------
if(x[i]==y[j])
dp[i][j]=dp[i-1][j-1]+1;
else
dp[i][j]=0;
------------------------------------------------------
if(dp[i-1]>0)
dp[i]=dp[i-1]+a[i];
else
dp[i]=a[i];
------------------------------------------------------