Cod sursa(job #1882121)

Utilizator VladTiberiuMihailescu Vlad Tiberiu VladTiberiu Data 16 februarie 2017 23:02:08
Problema Subsir crescator maximal Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 1.19 kb
#include <bits/stdc++.h>

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

const int NMax = 100003;
const int INF = 0x3f3f3f3f;

int nr,n;
int a[NMax],L[NMax],dp[NMax];

int cautbin(int lo,int hi,int x){
    int mid;
    while(lo <= hi){
        mid = (lo + hi) / 2;
        if(L[mid] >= x && L[mid - 1] < x){
            return mid;
        }else
        if(L[mid] >= x)
            hi = mid - 1;
        else
        if(L[mid - 1] < x)
            lo = mid + 1;
    }
    return 0;
}
int main()
{
    f >> n;
    for(int i = 1; i <= n; ++i){
        f >> a[i];
    }
    nr = 0;
    for(int i = 1; i <= n; ++i){
        if(L[nr] < a[i]){
            L[++nr] = a[i];
            dp[i] = nr;
        }else{
            int ind = cautbin(1,nr,a[i]);
            dp[i] = nr;
            L[ind] = a[i];
        }
    }
    g << nr << '\n';

    int e = 2000000003;
    vector<int> ans;
    for(int i = n; i >= 1; --i){
        if(dp[i] == nr && a[i] < e){
            ans.push_back(a[i]);
            e = a[i];
            nr--;
        }
    }
    for(int i = ans.size() - 1; i >= 0; --i){
        g << ans[i] <<  ' ';
    }
    return 0;
}