1045 Favorite Color Stripe

solution（LIS）

1. 找出喜欢颜色的LIS，所以先去掉不喜欢的颜色，只留下喜欢的颜色子序列。
2. 该子序列的优先级是喜欢程度，通过映射建立颜色和喜欢程度之间的对应关系。
3. 回归到基础LIS

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 10e4 + 10;
int a[maxn], love[maxn], dp[maxn];
int main(){
	int n, m, l, t, num = 0, ans = -1;
	memset(love, -1, sizeof(love));
	scanf("%d%d", &n, &m);
	for(int i = 0; i < m; i++){
		scanf("%d", &t);
		love[t] = i;;
	} 
	scanf("%d", &l);
	for(int j = 0; j < l; j++){
		scanf("%d", &t);
		if(love[t] != -1) a[num++] = t;
	}
	for(int i = 0; i < num; i++){
		dp[i] = 1;
		for(int j = 0; j < i; j++){
			if(love[a[i]] >= love[a[j]] && (dp[i] < dp[j] + 1)) dp[i] = dp[j] + 1;
		}
		ans = max(dp[i], ans);
	}
	printf("%d", ans);
	return 0;
}

或者

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 10e4 + 10;
int a[maxn], love[maxn] = {0}, dp[maxn];
int main(){
	int n, m, l, t, num = 0, ans = -1;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; i++){
		scanf("%d", &t);
		love[t] = i;;
	} 
	scanf("%d", &l);
	for(int j = 0; j < l; j++){
		scanf("%d", &t);
		if(love[t] > 0) a[num++] = love[t];
	}
	for(int i = 0; i < num; i++){
		dp[i] = 1;
		for(int j = 0; j < i; j++){
			if(a[i] >= a[j] && (dp[i] < dp[j] + 1)) dp[i] = dp[j] + 1;
		}
		ans = max(dp[i], ans);
	}
	printf("%d", ans);
	return 0;
}

solution(LCS)

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 210, L = 1e4 + 10;
int a[N], b[L], dp[N][L];
int main(){
	int n, m, l, t, num = 0;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; i++){
		scanf("%d", &a[i]);
	}
	scanf("%d", &l);
	for(int i = 1; i <= l; i++){
		scanf("%d", &b[i]);
	}
	for(int i = 0; i <= m; i++){//边界 
		dp[i][0] = 0;
	}
	for(int j = 0; j <= l; j++){
		dp[0][j] = 0;
	}
	for(int i = 1; i <= m; i++){//状态转移方程
		for(int j = 1; j <= l; j++){
			dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
			if(a[i] == b[j]) dp[i][j]++;
		}
	}
	printf("%d", dp[m][l]);
	return 0;
}