Pagini recente » Cod sursa (job #2617428) | Cod sursa (job #3151702) | Cod sursa (job #2517132) | Cod sursa (job #254412) | Cod sursa (job #2967954)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n;
int dp[100005];
int v[100005];
int t[100005];
int k;
int b_s(int val)
{
int st=1;
int dr=k;
int p=k+1;
while(st<=dr)
{
int mid = (st+dr)/2;
if(v[dp[mid]]<val)
{
st=mid+1;
}
else
{
p=mid;
dr=mid-1;
}
}
return p;
}
void rec(int poz)
{
if(poz!=0)
{
rec(t[poz]);
fout<<v[poz]<<' ';
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
dp[1]=1;
k=1;
for(int i=2;i<=n;i++)
{
int p = b_s(v[i]);
if(p==k+1)
{
dp[++k]=i;
t[i]=dp[k-1];
}
else
{
dp[p]=i;
t[i]=dp[p-1];
}
}
fout<<k<<'\n';
rec(dp[k]);
}