题目
思路
伊娃给出了喜欢的颜色和排序，也就是颜色之间的优先级，然后在给出的颜色中选择出最长不下降子串（由优先级判断而不是数字大小），也就转换成了经典的动态规划问题
代码
#include <iostream>
#include <string>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<list>
#include<sstream>
#include<string.h>
#include<math.h>
using namespace std;
#define nmax 300
#define inf 999999
vector<int> color;
int mark[nmax];
int _index = 1;
int main()
{
memset(mark, 0, sizeof(mark));
int n1, n2, n3;
cin >> n1;
cin >> n2;
for (int i = 0; i < n2; ++i) {
int tmp;
cin >> tmp;
mark[tmp] = _index++;
}
cin >> n3;
for (int i = 0; i < n3; ++i) {
int tmp;
cin >> tmp;
if (mark[tmp] != 0) {
color.emplace_back(tmp);
}
}
int dp[10005],ans = 0;
for (int i = 0; i < color.size(); ++i) {
dp[i] = 1;
for (int j = 0; j < i; ++j) {
if (mark[color[i]]>=mark[color[j]] && dp[i] < dp[j] + 1)
dp[i] = dp[j] + 1;
}
ans = max(ans, dp[i]);
}
cout << ans;
}