Pagini recente » Cod sursa (job #1849976) | Cod sursa (job #1651291) | Cod sursa (job #1190664) | Cod sursa (job #972816) | Cod sursa (job #2969414)
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
const int N = 1e5;
int n, lung[N + 1], pmax, val_min[N + 1], a[N + 1];
void refac_subsirul(int p, int val, int l)
{
if (l == 1)
return;
if (a[p] < val && lung[p] == l - 1)
{
refac_subsirul(p - 1, a[p], lung[p]);
cout << a[p] << " ";
}
else
refac_subsirul(p - 1, val, l);
}
int caut_bin(int v[], int n, int val)
{
int st = 1, dr = n, rez = 0;
while(st <= dr)
{
int m = (st + dr) / 2;
if(v[m] < val)
{
rez = m;
st = m + 1;
}
else
{
dr = m - 1;
}
}
return rez;
}
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
int n_val_min = 0;
for(int i = 1; i <= n; i++)
{
int j0 = caut_bin(val_min, n_val_min, a[i]);
if(j0 == n_val_min)
n_val_min++;
lung[i] = 1 + j0;
val_min[1 + j0] = a[i];
if(lung[i] > lung[pmax])
pmax = i;
}
cout << lung[pmax] << endl;
refac_subsirul(pmax, a[pmax] + 1, lung[pmax] + 1);
return 0;
}