//最长上升子序列
int dp[MAX_N],a[MAX_N],n,ans=0;
for(int i = 1;i <= n;i++){
dp[i]=1;
for(int j = 1;j < i;j++){
if(a[j]<a[i]){
dp[i]=max(dp[i],dp[j]+1);
}
}
ans=max(ans,dp[i]);
}
//最长公共子序列
char s1[MAX_N],s2[MAX_N];
int n,ans=0,lcs[MAX_N][MAX_N];
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
lcs[i][j]=0;
if(s1[i]==s2[j]){
lcs[i][j]=lcs[i-1][j-1]+1;
}else{
lcs[i][j]=max(lcs[i-1][j],lcs[i][j-1]);
}
ans=max(ans,lcs[i][j]);
}
}
int dp[MAX_N],a[MAX_N],n,ans=0;
for(int i = 1;i <= n;i++){
dp[i]=1;
for(int j = 1;j < i;j++){
if(a[j]<a[i]){
dp[i]=max(dp[i],dp[j]+1);
}
}
ans=max(ans,dp[i]);
}
//最长公共子序列
char s1[MAX_N],s2[MAX_N];
int n,ans=0,lcs[MAX_N][MAX_N];
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
lcs[i][j]=0;
if(s1[i]==s2[j]){
lcs[i][j]=lcs[i-1][j-1]+1;
}else{
lcs[i][j]=max(lcs[i-1][j],lcs[i][j-1]);
}
ans=max(ans,lcs[i][j]);
}
}