cf10D. LCIS

链接

点击跳转

题解

$f_{ij}$表示第一个序列的前$i$个元素和第二个序列的前$j$个元素的$LCIS$，强制包含$a_i$但不强制包含$b_j$，直接转移即可

输出方案有点繁琐，记录每种状态的决策，最后用$for$循环倒着找一下，稍微想想应该不难写

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ll f[510][510], n, m, a[maxn], b[maxn], d[510][510];
int main()
{
    ll i, j, k, ans=0;
    n=read();
    rep(i,n)a[i]=read()+1;
    m=read();
    rep(i,m)b[i]=read()+1;
    rep(i,n)
    {
        f[i][0]=-linf;
        rep(j,m)
        {
            f[i][j]=f[i][j-1];
            if(a[i]==b[j])
            {
                for(k=0;k<i;k++)
                    if(a[k]<a[i])
                    {
                        if(f[k][j-1]+1>f[i][j])
                        {
                            f[i][j]=f[k][j-1]+1;
                            d[i][j]=k;
                        }
                    }
            }
        }
        if(f[i][m]>f[ans][m])ans=i;
    }
    printf("%lld\n",f[ans][m]);
    stack<ll> s;
    for(i=ans,j=m;i;)
    {
        s.em(a[i]);
        while(f[i][j]==f[i][j-1])j--;
        i=d[i][j];
    }
    while(s.size())printf("%lld ",s.top()-1), s.pop();
    return 0;
}