cf486E. LIS of Sequence

链接

点击跳转

题解

正着倒着各$dp$一次

一个位置$p$填$2$的条件是$f_1[p]+f_2[p]-1=len(LIS)$且还有别的$p^{\prime }$满足这个式子并有$f_1[p^{\prime }]=f1[p]$

代码

#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 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
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 f1[maxn], f2[maxn], tot, tmp[maxn], n, ans[maxn], cnt[maxn], a[maxn];
int main()
{
    ll i, j;
    n=read();
    rep(i,n)a[i]=read();
    
    tmp[tot=1]=a[1];
    f1[1]=1;
    for(i=2;i<=n;i++)
    {
        if(a[i]>tmp[tot])tmp[++tot]=a[i];
        ll p=lower_bound(tmp+1,tmp+tot+1,a[i])-tmp;
        f1[i]=p;
        tmp[p]=min(tmp[p],a[i]);
    }
    // rep(i,n)printf("f1[%lld]=%lld\n",i,f1[i]);

    tmp[tot=1]=-a[n];
    f2[n]=1;
    for(i=n-1;i;i--)
    {
        if(-a[i]>tmp[tot])tmp[++tot]=-a[i];
        ll p=lower_bound(tmp+1,tmp+tot+1,-a[i])-tmp;
        f2[i]=p;
        tmp[p]=min(tmp[p],-a[i]);
    }
    // rep(i,n)printf("f2[%lld]=%lld\n",i,f2[i]);


    ll mx=0;
    rep(i,n)mx=max(mx,f1[i]);

    rep(i,n)if(f1[i]+f2[i]-1==mx)cnt[f1[i]]++;

    rep(i,n)
    {
        if(f1[i]+f2[i]-1!=mx)
        {
            ans[i]=1;
        }
        else
        {
            if(cnt[f1[i]]==1)
            {
                ans[i]=3;
            }
            else ans[i]=2;
        }
    }

    rep(i,n)printf("%lld",ans[i]);
    return 0;
}