soj 2804 Longest Ordered Subsequence (II) LIS nlogn

LIS~

现在来细想这种nlogn的LIS实际上一种巧妙的构造,维护一个最小心态的IS.

code:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <string>
#include <queue>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
typedef pair<int, int> pii;
typedef long long ull;
typedef long long ll;
typedef vector<int> vi;
#define xx first
#define yy second
#define rep(i, a, n) for (int i = a; i < n; i++)
#define sa(n) scanf("%d", &(n))
#define vep(c) for(decltype((c).begin()) it = (c).begin(); it != (c).end(); it++)
const int mod = int(1e9) + 7, INF = 0x3fffffff, maxn = 1e5 + 12;
int a[maxn * 10], dp[maxn * 10];

int main(void)
{
    int n;
    while (~sa(n)) {
        rep(i, 0, n) {
            sa(a[i]);
        }

        fill(dp, dp + n, INF);
        rep (i, 0, n) {
             *lower_bound(dp, dp + n, a[i]) = a[i];
        }

        cout << lower_bound(dp, dp + n, INF) - dp << endl;
    }
}