Pagini recente » Cod sursa (job #2728730) | Cod sursa (job #2888390) | Cod sursa (job #2335855) | Cod sursa (job #769205) | Cod sursa (job #2511832)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMAX = 100005;
int N, V[NMAX], best[NMAX], pre[NMAX], maxim, k, L[NMAX], nr;
void afis(int i)
{
if(pre[i] > 0)
afis(pre[i]);
fout << V[i] << " ";
}
int cauta(int x)
{
int st, dr, mid;
st = 0;
dr = nr;
mid = (st + dr) / 2;
while(st <= dr) {
if(V[L[mid]] < x && V[L[mid+1]] >= x)
return mid;
else if(V[L[mid + 1]] < x) {
st = mid + 1;
mid = (st + dr) / 2;
}
else {
dr = mid - 1;
mid = (st + dr) / 2;
}
}
return nr;
}
int main()
{
int poz;
nr = 1;
fin >> N;
for(int i = 1; i <= N; i++)
fin >> V[i];
best[1] = L[1] = 1;
L[0] = 0;
for(int i = 2; i <= N; i++) {
poz = cauta(V[i]);
pre[i] = L[poz];
best[i] = poz + 1;
L[poz + 1] = i;
if(nr < poz + 1)
nr = poz + 1;
}
maxim = 0;
poz = 0;
for(int i = 1; i <= N; i++)
if(maxim < best[i]) {
maxim = best[i];
poz = i;
}
fout << maxim << "\n";
afis(poz);
}