Cod sursa(job #2441846)

Utilizator miguelMihail Lavric miguel Data 21 iulie 2019 14:01:38
Problema Subsir crescator maximal Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.18 kb
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define int ll
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, pi>
#define vi vector <int>
const ll nmax=5e4+2;
const ll mod = 998244353;
int n, dp[100001], idp[100001], a[100001], p[100001]; ///idp = id dp

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    ifstream cin("scmax.in");
    ofstream cout("scmax.out");
    cin>>n;
    for(int i=1; i<=n; i++) dp[i]=(int)1e18;
    for(int i=1; i<=n; i++){
        cin>>a[i];
        int idx=lower_bound(dp+1, dp+n+1, a[i])-dp;
        //if(dp[idx-1]<a[i] && a[i]<dp[idx])
        p[i]=idp[idx-1];
        dp[idx]=a[i];
        idp[idx]=i;
    }
    int ans=0;
   // for(int i=1; i<=n; i++) cout<<dp[i]<<" ";
    for(int i=1; i<=n; i++) if(dp[i]<=(int)2000000000) ans=i;
    cout<<ans<<"\n";
    int lst=idp[ans];
    vi xd;
    while(lst!=0){
        xd.pb(a[lst]);
        lst=p[lst];
    }
    reverse(xd.begin(), xd.end());
    for(int i: xd) cout<<i<<" ";
}