bzoj1046: [HAOI2007]上升序列

题面在这里

做法：
先预处理出$f[i]$表示第i个数字开始的最长上升子序列长度。这个相当于倒着求一遍最长下降子序列。
然后贪心。对于每一个询问$len$，我们从左到右扫描，若当前的$f[i]>=len$且$a_i>last$，则输出这个数并更新为$last$，然后$len --$。直到$len=0$为止。

话说$O(nlogn)$的$lis$应该都会的吧= =就不多说了吧、、

/*************************************************************
    Problem: bzoj 1046 [HAOI2007]上升序列
    User: fengyuan
    Language: C++
    Result: Accepted
    Time: 1780 ms
    Memory: 1404 kb
    Submit_Time: 2017-12-15 13:34:58
*************************************************************/

#include<bits/stdc++.h>
#define rep(i, x, y) for (int i = (x); i <= (y); i ++)
#define down(i, x, y) for (int i = (x); i >= (y); i --)
#define mid ((l+r)/2)
#define lc (o<<1)
#define rc (o<<1|1)
#define pb push_back
#define mp make_pair
#define PII pair<int, int>
#define F first
#define S second
#define B begin()
#define E end()
using namespace std;
typedef long long LL;
//head

const int N = 10010;
int n, m;
int a[N], b[N], f[N];

inline int find(int x, int l, int r)//从左往右第一个小于等于 
{
    int ret;
    while (l <= r) if (b[mid] <= x) ret = mid, r = mid-1; else l = mid+1;
    return ret;
}

int main()
{
    scanf("%d", &n);
    rep(i, 1, n) scanf("%d", &a[i]);
    int ans = 0;
    down(i, n, 1){
        if (!ans){ b[++ ans] = a[i]; f[i] = 1; continue; }
        if (a[i] < b[ans]) b[++ ans] = a[i], f[i] = ans;
        else {
            int t = find(a[i], 1, ans);
            f[i] = t; b[t] = a[i];
        }
    }
    scanf("%d", &m);
    while (m --){
        int len; scanf("%d", &len);
        if (len > ans){ puts("Impossible"); continue; }
        int last = -1e9;
        rep(i, 1, n){
            if (!len) break;
            if (f[i] >= len && a[i] > last) len --, printf("%d", last = a[i]), putchar(!len ? '\n' : ' ');
        }
    }
    return 0;
}