Pagini recente » Cod sursa (job #2613949) | Cod sursa (job #1400181) | Cod sursa (job #2525345) | Cod sursa (job #2977679) | Cod sursa (job #2576398)
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, a[100005], lungime=0, p[100005],dp[100005];
stack<int>stiva;
int cb(int x)
{
int st=1, dr=lungime;
while (st<=dr)
{
int mij=(st+dr)/2;
if (dp[mij]>=x)
{
dr=mij-1;
}
else
{
st=mij+1;
}
}
if (st==lungime+1)
return -1;
return st;
}
/*
void afisare( )
{
for(int i=n;i>0;i--)
{
if((p[i]==lungime && stiva.top()>a[i] )|| stiva.empty())
{
stiva.push(a[i]);
lungime--;
}
}
while (!stiva.empty()) {
fout<<stiva.top()<<" ";
stiva.pop();
}
}*/
void afisare(int poz, int n)
{
if (poz==0)
return;
for (int i=n; i>0; --i)
{
if (p[i]==poz)
{
afisare(poz-1,i-1);
fout<<a[i] <<' ';
return;
}
}
}
int main()
{
fin >> n;
for (int i=1; i<=n; i++)
{
fin >> a[i];
int poz=cb(a[i]);
if (poz==-1)
{
dp[++lungime]=a[i];
p[i]=lungime;
}
else
{
dp[poz]=a[i];
p[i]=poz;
}
}
fout<< lungime << "\n";
afisare(lungime,n);
return 0;
}