Pagini recente » Cod sursa (job #2886352) | Cod sursa (job #2374121) | Cod sursa (job #135289) | Cod sursa (job #1419229) | Cod sursa (job #1678351)
#include <fstream>
#define nMax 100005
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, k;
int scmax[nMax], Sol[nMax], v[nMax];
void read()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
}
int binary_search_right(int val)
{
int st=1, dr=k, poz=0;
while(st<=dr)
{
int mid=st+(dr-st)/2;
if(val<=scmax[mid])
{
poz=mid;
dr=mid-1;
}
else
st=mid+1;
}
return poz;
}
void solve()
{
for(int i=1;i<=n;i++)
{
int poz=binary_search_right(v[i]);
if(poz==0)
{
scmax[++k]=v[i];
Sol[i]=k;
}
else
{
scmax[poz]=v[i];
Sol[i]=poz;
}
}
fout<<k<<'\n';
}
void write(int poz, int cnt)
{
if(cnt==0)
return;
if(Sol[poz]==cnt)
{
write(poz-1, cnt-1);
fout<<v[poz]<<" ";
}
else
write(poz-1, cnt);
}
int main()
{
read();
solve();
write(n, k);
return 0;
}