Pagini recente » Cod sursa (job #2695146) | Cod sursa (job #1587647) | Cod sursa (job #1190679) | Cod sursa (job #2789861) | Cod sursa (job #2561406)
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int d[100005];
int v[100005];
int main()
{
int n , best = 0 , k = 0 , i , pas , ac;
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];
if(ac + pas + 1 > best)
best = ac + pas + 1;
}
cout << best << '\n';
for(i = 1; i <= n; i++)
{
pas = 1 << 16;
ac = 0;
while(pas)
{
if(ac + pas <= k)
if(d[ac + pas] < v[i])
ac += pas;
pas /= 2;
}
d[ac + pas + 1] = v[i];
if(ac + pas + 1 > k)
k = ac + pas + 1;
if( k == best)
{
for(i = 1; i <= k; i++)
cout << d[i] << " ";
break;
}
}
return 0;
}