bzoj1046: [HAOI2007]上升序列

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(register int i=s;i<=t;i++)
#define dwn(i,s,t) for(register int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
int read(){
    int x=0,f=1;char c=getchar();
    while(!isdigit(c)){
        if(c==‘-‘) f=-1;c=getchar();
    }
    while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
    return x*f;
}
const int nmax=1e4+5;
const int inf=0x7f7f7f7f;
int a[nmax],b[nmax],f[nmax],n;
void mins(int &a,int b){
    if(a>b) a=b;
}
void maxs(int &a,int b){
    if(a<b) a=b;
}
int find(int x){
    int l=1,r=n,ans=0;
    while(l<=r){
        int mid=(l+r)>>1;
        if(b[mid]>x) ans=mid,l=mid+1;
        else r=mid-1;
    }
    return ans;
}
int main(){
    n=read();int mx=0;
    rep(i,1,n) a[i]=read();
    dwn(i,n,1){
        int t=find(a[i])+1;f[i]=t;
        maxs(mx,t);maxs(b[t],a[i]);
    }
    //rep(i,1,n) printf("%d ",f[i]);printf("\n");
    int m=read(),u,v;
    rep(j,1,m){
        u=read();v=-inf;
        if(u>mx) printf("Impossible\n");
        else {
            bool flag=0;
            rep(i,1,n) {
                if(f[i]>=u&&a[i]>v) {
                    if(!flag) printf("%d",a[i]),flag=1;
                    else printf(" %d",a[i]);
                    u--;v=a[i];
                    if(!u) break;
                }
            }
            printf("\n");
        }
    }
    return 0;
}