算法导论 DP LIS(O(nlog(n))复杂度实现)

最新推荐文章于 2024-08-18 21:10:03 发布

xcatf

最新推荐文章于 2024-08-18 21:10:03 发布

阅读量265

点赞数

分类专栏：动态规划文章标签：动态规划

本文链接：https://blog.csdn.net/qq1013459920/article/details/89458946

版权

动态规划专栏收录该内容

13 篇文章 0 订阅

订阅专栏

关键在于二分查找

/*
    Author:html_11
*/
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <climits>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
#define e 2.718281828459
#define eps 1e-10
using namespace std;
typedef long long ll;
static const int MAX_N = 1e3 + 5;
static const ll Mod = 2009;
int a[MAX_N];
int main() {
	/* freopen("input.txt", "r", stdin);
	 freopen("output.txt", "w", stdout);*/
	int n;
	while (scanf("%d", &n) != EOF) {
		int cnt = 0;
		a[cnt] = -INF;
		for (int i = 0; i < n; ++i) {
			int v;
			scanf("%d", &v);
			if (a[cnt] < v) a[++cnt] = v;
			else {
				int l = 1, r = cnt;
				while (l <= r) {
					int m = (l + r) >> 1;
					if (a[m] >= v) r = m - 1;
					else l = m + 1;
				}
				a[l] = v;
			}
		}
		printf("%d\n", cnt);
	}
	return 0;
}