1045

没想到O(n^2)的时间复杂度竟然可以过

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int main()
{
	int n,m,l;
	map<int, int> Like;
	vector<int> A;
	int r = 0;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int a;
		cin >> a;
		if (Like.find(a)==Like.end())
		{
			r++;
			Like[a] = r;
		}
	}
	cin >> l;
	for (int i = 0; i < l; i++)
	{
		int a;
		cin >> a;
		if (Like.find(a) != Like.end())
			A.push_back(Like[a]);
	}
	l = A.size();
	vector<int> Dp(l, 1);
	for (int i = 0; i < l; i++)
	{
		for (int j = 0; j < i; j++)
		{
			if (A[j] <= A[i])
				Dp[i] = max(Dp[i], Dp[j] + 1);
		}
		
	}
	cout << Dp[l - 1] << endl;
	system("pause");
	return 0;
}