Pagini recente » Cod sursa (job #41743) | Cod sursa (job #1297544) | Monitorul de evaluare | Cod sursa (job #1766867) | Cod sursa (job #2967549)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int N = 100000;
int x[1+N], lung[1+N], val_min[1+N];
void refac_subsirul(int p, int val, int l)
{
if (l == 1)
{
return;
}
if (x[p] < val && lung[p] == l - 1)
{
refac_subsirul(p - 1, x[p], lung[p]);
out << x[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 mij = (st + dr) / 2;
if (v[mij] < val)
{
rez = mij;
st = mij + 1;
}
else
{
dr = mij - 1;
}
}
return rez;
}
int main()
{
int n;
in >> n;
for (int i = 1; i <= n; i++)
{
in >> x[i];
}
int n_val_min = 0, pmax = 1;
for (int i = 1; i <= n; i++)
{
int j0 = caut_bin(val_min, n_val_min, x[i]);
if (j0 == n_val_min)
{
n_val_min++;
}
lung[i] = j0 + 1;
val_min[lung[i]] = x[i];
if (lung[i] > lung[pmax])
{
pmax = i;
}
}
out << lung[pmax] << "\n";
refac_subsirul(pmax, x[pmax] + 1, lung[pmax] + 1);
return 0;
}