Cod sursa(job #2664826)

Utilizator liviu2000Dragomirescu Liviu liviu2000 Data 29 octombrie 2020 15:36:31
Problema Subsir crescator maximal Scor 65
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.14 kb
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void debug3(int *t,int st,int n) {cerr << '{' << t[st];for(int i=st+1;i<=n;i++) cerr<<",",__print(t[i]);cerr <<"}"<<'\n';}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#define debug2(x...) cerr<<"[" << #x << "] = "; debug3(x)
#endif

#define N 100005
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define sf second.first
#define ss second.second
#define INF 1e9

int v[N];
vector<int> s;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("test.in", "r", stdin);
    ifstream fin("scmax.in") ;
    ofstream fout("scmax.out") ;

    int i,n;
    fin >> n ;
    for ( i = 1 ; i <= n ; i++ )
        fin >> v[i] ;

    for ( i = 1 ; i <= n ; i++ )
    {
        auto x = lower_bound(s.begin(),s.end(),v[i]) ;
        if ( x==s.end() )
            s.push_back(v[i]) ;
        else
            *x = v[i] ;
    }
    fout << s.size() << '\n' ;
    for ( auto vec : s )
        fout << vec << " " ;
}