Cod sursa(job #1339114)

Utilizator Alexandra_MMihaila Alexandra Alexandra_M Data 10 februarie 2015 18:06:39
Problema Subsir crescator maximal Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1.36 kb
#include <cstdio>
#define dmax 100005
#define IN "scmax.in","r"
#define OUT "scmax.out","w"

using namespace std;
//ifstream fin (IN);
//ofstream fout (OUT);
FILE*fin=fopen(IN);
FILE*fout=fopen(OUT);

int n, pozcr=1;;
int best[dmax], poz[dmax], v[dmax], sol[dmax];

void read();
void rez();
void write();
int CB(int,int);

int main()
{
    read();
    rez();
    write();
    return 0;
}
void read()
{
    //fin>>n;
    fscanf(fin,"%d",&n);
    for (int i=1; i<=n; ++i)
        //fin>>v[i];
        fscanf(fin,"%d",&v[i]);
}
void rez()
{
    best[1]=v[1];
    poz[1]=1;
    for (int i=2; i<=n; ++i)
        if (v[i]>best[pozcr])
        {
            best[++pozcr]=v[i];
            poz[i]=pozcr;
        }
        else
        {
            poz[i]=CB(i,pozcr);
            best[poz[i]]=v[i];
        }
}
int CB(int i,int m)
{
    int st=1, dr=m, mij;
    while (st<dr)
    {
        mij=(st+dr+1)/2;
        if (best[mij]>v[i])
            dr=mij;
        else
            st=mij;
    }
    return dr;
}
void write()
{
    //fout<<pozcr<<'\n';
    fprintf(fout,"%d\n",pozcr);
    int p=pozcr;
    for (int i=n; i>0; --i)
        if (poz[i]==pozcr)
            sol[pozcr--]=v[i];
    for (int i=1; i<=p; ++i)
        //fout<<sol[i]<<' ';
        fprintf(fout,"%d ",sol[i]);
    //fout.close();
    fclose(fout);
}