Pagini recente » Cod sursa (job #997675) | Monitorul de evaluare | Istoria paginii runda/vot/voteaza_algorel | Cod sursa (job #1614740) | Cod sursa (job #2561432)
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int d[100005];
int v2[100005];
int v[100005];
int main()
{
int n , best = 0 , k = 0 , i , pas , ac , j;
cin >> n;
for(i = 1; i <= n; i++)
cin >> v[i];
for(i = 1; i <= n; i++)
{
pas = 1 << 16;
ac = 0;
while(pas)
{
if(ac + pas <= best)
if(d[ac + pas] < v[i])
ac += pas;
pas /= 2;
}
d[ac + pas + 1] = v[i];
v2[i] = ac + pas + 1;
if(ac + pas + 1 > best)
{best = ac + pas + 1;
j = i;}
}
cout << best << '\n';
ac = best;
while(j)
{
if(v2[j] == ac)
{d[ac] = v[j];
ac--;}
j--;
}
for(i = 1; i <= best; i++)
cout << d[i] << " ";
return 0;
}