每日一题4.18.2

每日一题4.18.2

最长上升子序列

代码实现：

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int n;
	while (cin >> n)
	{
		vector<int> arr(n,0);
		for (int i = 0; i < n; i++)
		{
			cin >> arr[i];
		}
		vector<int> s(n, 1);
		int maxsize = 1;
		for (int i = 1; i < n; i++)
		{
			for (int j = 0; j < i; j++)
			{
				if (arr[i]>arr[j])
					s[i] = max(s[i], s[j]+ 1);
			}
			maxsize = max(maxsize, s[i]);
		}
		cout << maxsize << endl;
	}
	return 0;
}