Cod sursa(job #3317764)

Utilizator st3fann_24Nica Stefan st3fann_24 Data 25 octombrie 2025 11:35:50
Problema Subsir crescator maximal Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.18 kb
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MOD 1000000007

std::ifstream f("scmax.in");
std::ofstream g("scmax.out");

int n, lgmax = 1, best[100005], v[100005], poz[100005], sol[100005];
int cb(int x);
int main(){
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    std::cout.tie(NULL);
    // f.tie(NULL);
    // g.tie(NULL);

    f >> n;
    std::vector<int> v(n + 1), poz(n + 1);
    for(int i = 1; i <= n; ++i)
        f >> v[i];
    best[1] = v[1];
    poz[1] = 1;
    for(int i = 2; i <= n; ++i) 
        if(v[i] > best[lgmax])
            best[++lgmax] = v[i], poz[i] = lgmax;
        else{
            int p = cb(v[i]);
            best[p] = v[i];
            poz[i] = p;
        }
    g << lgmax << '\n';
    for(int j = n, i = lgmax; j; --j){
        if(poz[j] == i)
            sol[i] = v[j], --i;
    }
    for(int i = 1; i <= lgmax; ++i)
        g << sol[i] << ' ';
    return 0;
}
int cb(int x){
    int st = 0, dr = lgmax + 1;
    while(dr - st > 1){
        int mid = (st + dr) / 2;
        if(best[mid] <= x)
            st = mid;
        else dr = mid;
    }
    return dr;
}