Pagini recente » Cod sursa (job #407443) | Cod sursa (job #995637) | Cod sursa (job #2797195) | Cod sursa (job #2769369) | Cod sursa (job #2291967)
#include <iostream>
#include <fstream>
std::ifstream fin("scmax.in");
std::ofstream fout("scmax.out");
int sequence[100005], parent[100005], v[100005], solutii[100005];
int n, lmax, last_position;
int caut_bin(int elem)
{
int st = 0, dr = lmax, m;
while (st < dr)
m = (st + dr) >> 1, (v[sequence[m]] < elem) ? st = m + 1 : dr = m;
return st;
}
int main()
{
fin >> n;
int i = 0, pos;
while(fin >> v[i])
sequence[i] = 0, parent[i++] = -1;
for (i = 1; i < n; i++)
{
(v[i] < v[sequence[0]]) ? sequence[0] = i : v[i] > v[sequence[lmax]] ? parent[i] = sequence[lmax],lmax++,sequence[lmax] = i,last_position = i : (pos = caut_bin(v[i]), parent[i] = sequence[pos - 1],sequence[pos] = i);
/*if (v[i] < v[sequence[0]])
sequence[0] = i;
else if (v[i] > v[sequence[lmax]])
{
parent[i] = sequence[lmax];
lmax++;
sequence[lmax] = i;
last_position = i;
}
else
{
pos = caut_bin(v[i]);
parent[i] = sequence[pos - 1];
sequence[pos] = i;
}*/
}
int copie = lmax;
fout << lmax + 1 << '\n';
while (parent[last_position] != -1)
{
solutii[copie] = v[last_position];
last_position = parent[last_position];
copie--;
}
solutii[copie] = v[last_position];
for (i = 0; i <= lmax; i++)
fout << solutii[i] << ' ';
return 0;
}