Pagini recente » Cod sursa (job #3255536) | Cod sursa (job #876945) | IAP #5: Open surse | Cod sursa (job #3040300) | Cod sursa (job #2037461)
#include <fstream>
#include <iostream>
using namespace std;
int a[100001],v[100001],sol[100001],p[100001];
int n,Lmax;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
void Scmax();
int Cautare_Binara(int x);
void Scrie_Sir();
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> a[i];
// cout << Cautare_Binara(a[3]);
Scmax();
Scrie_Sir();
}
void Scmax()
{
for (int i = 1; i <= n; i++)
{
int poz = Cautare_Binara(a[i]);
v[poz] = a[i];
p[i] = poz;
if (poz > Lmax)
Lmax = poz;
}
}
void Scrie_Sir()
{
int k = Lmax,j = 1;
for (int i = n; i >= 1; i--)
if(p[i] == k)
{
sol[j++] = a[i];
k--;
}
fout << Lmax << '\n';
for (int i = j - 1; i >= 1; --i)
fout << sol[i] << ' ';
}
int Cautare_Binara(int x)
{
if(x > v[Lmax])
return Lmax + 1;
int l = 1,r = Lmax,m,poz = 1;
while(l <= r)
{
m = (l + r) / 2;
if(v[m] >= x)
{
poz = m;
r = m - 1;
}
else
l = m + 1;
}
//v[poz] = x;
return poz;
}