BZOJ 1046 上升序列(LIS变形)

要保证长度为L的序列下标字典序最小，当然要尽量选前面的数。

如何判断前面的数是否满足条件？，只需要知道这个数开头的递增序列的最长长度是多少，如果不小于L，那么必然可以加入这个数。还需判断一下它是否大于前面的那个数就行了。

LIS用nlogn。

# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <set>
# include <cmath>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi acos(-1.0)
# define eps 1e-
# define MOD
# define INF
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
# define lch p<<,l,mid
# define rch p<<|,mid+,r
# define mp make_pair
# define pb push_back
typedef pair<int,int> PII;
typedef vector<int> VI;
# pragma comment(linker, "/STACK:1024000000,1024000000")
typedef long long LL;
int Scan() {
    int res=, flag=;
    char ch;
    if((ch=getchar())=='-') flag=;
    else if(ch>=''&&ch<='') res=ch-'';
    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');
    return flag?-res:res;
}
void Out(int a) {
    if(a<) {putchar('-'); a=-a;}
    if(a>=) Out(a/);
    putchar(a%+'');
}
const int N=;
//Code begin...
 
int a[N], dp[N], len[N], num=;
 
int bin_sea(int x)
{
    int l=, r=num+, mid;
    while (l<r) {
        mid=(l+r)>>;
        if (len[mid]<=x) r=mid;
        else l=mid+;
    }
    if (r==num+) ++num;
    len[r]=x;
    return r;
}
int main ()
{
    int n, m, l, ma=;
    scanf("%d",&n);
    FOR(i,,n) scanf("%d",a+i);
    for (int i=n; i>=; --i) dp[i]=bin_sea(a[i]), ma=max(ma,dp[i]);
    scanf("%d",&m);
    while (m--) {
        scanf("%d",&l);
        if (l>ma) {puts("Impossible"); continue;}
        int pre=;
        FOR(i,,n) {
            if (dp[i]>=l&&a[i]>pre) printf(l==?"%d":"%d ",a[i]), --l, pre=a[i];
            if (!l) break;
        }
        putchar('\n');
    }
    return ;
}