Cod sursa(job #1251964)

Utilizator 0051David Sera 0051 Data 30 octombrie 2014 09:11:46
Problema Subsir crescator maximal Scor 15
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n,a[100002],b[100002],rez[100002];
vector < int > v[100002];

int caut(int a[], int n, int val)
{
    int st, dr, m;
    st=1;
    dr=n;
    while(st<=dr)
    {
        m=(st+dr)/2;
        if(a[m]<val && a[m+1]>=val)
            return m;
        if(a[m]<val)
            st=m+1;
        else
            dr=m-1;
    }
    return 0;
}

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++){
        fin>>a[i];
        b[i]=1<<28;
    }
    b[n+1]=1<<28;
    b[0]=-(1<<28);
    int m=0,j;
    for(int i=1;i<=n;i++)
    {
        j=caut(b,n,a[i]);
        v[j+1].push_back(a[i]);
        b[j+1]=a[i];
        m=max(m,j+1);
    }
    rez[m]=b[m];
    for(int i=m-1;i>=1;i--)
    {
        for(int j=1;j<=v[i].size();j++)
            if(v[i][j]<rez[i+1])
                rez[i]=v[i][j];
    }
    fout<<m<<"\n";
    for(int i=1;i<=m;i++)
        fout<<rez[i]<<" ";
    fin.close();
    fout.close();
    return 0;
}