UVA 10534 Wavio Sequence (nlogn的LIS)

题意：求给出序列中长为2n+1的最长子序列，前n+1为严格上升，后n+1为严格下降。

题解：nlogn的LIS
从左往右，从右往左处理LIS，再遍历。
用二分，复杂度为nlogn。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
const int maxn = 1e4 + 5;
int n, a[maxn], b[maxn], s[maxn], dp[maxn];
int main() {
	while (~scanf("%d", &n)) {
		for (int i = 1; i <= n; i++) {
			scanf("%d", &s[i]);
		}
		/*for (int i = 1; i <= n; i++) {
			a[i] = 1;
			for (int j = 1; j < i; j++) {
				if (s[j] < s[i]) a[i] = max(a[i], a[j] + 1);
			}
		}
		for (int i = n; i >= 1; i--) {
			b[i] = 1;
			for (int j = i + 1; j <= n; j++) {
				if (s[i] > s[j]) b[i] = max(b[i], b[j] + 1);
			}
		}*/
		memset(dp, 0x3f3f3f3f, sizeof(dp));
		for (int i = 1; i <= n; ++i)
			dp[a[i] = (lower_bound(dp + 1, dp + n + 1, s[i]) - dp)] = s[i];
		memset(dp, 0x3f3f3f3f, sizeof(dp));
		for (int i = n; i >= 1; --i)
			dp[b[i] = (lower_bound(dp + 1, dp + n + 1, s[i]) - dp)] = s[i];
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			ans = max(ans, min(a[i], b[i]) * 2 - 1);
		}
		printf("%d\n", ans);
	}
	return 0;
}