Pagini recente » Cod sursa (job #2507069) | Cod sursa (job #2563599) | Cod sursa (job #1119827) | Cod sursa (job #2078118) | Cod sursa (job #1550302)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,ls,ld,mij,s[100010],v[100010],p[100010],sol[100010];
int main()
{
fin>>n;
fin>>v[ 1 ];
p[ 0 ] = 1;
p[ 1 ] = v[ 1 ];
s[ 1 ] = 1;
for( i = 2 ; i <= n ; i++ )
{
fin>>v[ i ];
ls = 1;
ld = p[ 0 ];
mij = ls + ( ld - ls ) / 2;
while( ls < ld )
{
if( p[ mij ] >= v[ i ] )
ld = mij - 1;
else
ls = mij + 1;
mij = ls + ( ld - ls ) / 2;
}
if( p[ ls ] != v[ i ] )
{
if( p[ ls ] >= v[ i ] )
p[ ls ] = v[ i ];
else
p[ ++p[ 0 ] ] = v[ i ],++ls;
}
s[ i ] = ls;
}
fout<<p[0]<<'\n';
for( i = n ; i >= 1 ; i-- )
{
if( s[ i ] == p[ 0 ] )
{
sol[ p[ 0 ]-- ] = v[ i ];
++s[ 0 ];
}
}
for( i = 1 ; i <= s[ 0 ] ; i++ )
fout<<sol[ i ]<<' ';
return 0;
}