bzoj1046: [HAOI2007]上升序列

真尼玛神坑

m还可以等于0

mgj

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>

using namespace std;

void setIO(const string& s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
template<typename Q> Q read(Q& x) {
    static char c, f;
    for(f = 0; c = getchar(), !isdigit(c); ) if(c == '-') f = 1;
    for(x = 0; isdigit(c); c = getchar()) x = x * 10 + c - '0';
    if(f) x = -x;
    return x;
}
template<typename Q> Q read() {
    static Q x; read(x); return x;
}

const int N = 10000 + 10, INF = ~0u >> 1;
int a[N], s[N], f[N];

int main() {
#ifdef DEBUG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    
    int n, m; read(n);
    for(int i = 1; i <= n; i++) read(a[i]), a[i] = -a[i];
    memset(s, 0x7f, sizeof s); 
    for(int i = n; i >= 1; i--) {
        int t = lower_bound(s + 1, s + n + 1, a[i]) - s;
        f[i] = t;
        s[t] = a[i];
    }
    read(m);
    while(m--) {
        int r = read<int>(), last = INF;
        if(!r) puts("");
        else {
            for(int i = 1; r && i <= n; i++) {
                if(f[i] >= r && a[i] < last) last = a[i], printf("%d%c", -a[i], (!--r) ? '
' : ' ');
            }
            if(r) puts("Impossible");
        }
    }
    
    return 0;
}