Pagini recente » Cod sursa (job #3270784) | Cod sursa (job #1447983) | Cod sursa (job #2372305) | Cod sursa (job #2846512) | Cod sursa (job #2131391)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, k;
long long lis[100005];
void LIS(int x)
{
if(x == lis[k])
return;
if(x > lis[k])
{
lis[++k] = x;
return;
}
if(x < lis[1])
{
lis[1] = x;
return;
}
int st = 1, dr = n, mij, poz = -1;
while(st <= dr)
{
mij = (st + dr) / 2;
if(lis[mij] > x)
{
poz = mij;
dr = mij - 1;
}
else st = mij + 1;
}
lis[poz] = x;
}
void Citire()
{
int x;
fin >> n;
for(int i = 1; i <= n; i++)
fin >> x,
LIS(x);
}
int main()
{
Citire();
fout << k << "\n";
for(int i = 1; i <= k; i++)
fout << lis[i] << " ";
return 0;
}