Pagini recente » Borderou de evaluare (job #571036) | Cod sursa (job #1586286) | Cod sursa (job #2076080) | Cod sursa (job #166773) | Cod sursa (job #2202792)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, a[100001], capete[100001], v[100001], k, b[100001];
int Cautare_Binara(int li, int ls, int x)
{
int raspuns = -1;
while(li <= ls)
{
int mij = (li + ls)/2;
if(capete[mij] < x)
{
raspuns = mij;
li = mij + 1;
}
else
{
ls = mij - 1;
}
}
return raspuns;
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
{
fin >> v[i];
}
for(int i = 1; i <= n; i++)
{
int poz;
poz = Cautare_Binara(0, k, v[i]);
a[i] = poz + 1;
capete[poz+1] = v[i];
k = max(k, poz+1);
}
int p = 0;
fout << k << '\n';
for(int i = n; i > 0; i--)
{
if(a[i] == k)
{
b[p++] = v[i];
k--;
}
}
for(int i = p-1; i >=0; i--)
fout << b[i] << " ";
return 0;
}