Pagini recente » Cod sursa (job #1552729) | Cod sursa (job #420727) | Cod sursa (job #2783372) | Cod sursa (job #686248) | Cod sursa (job #1804866)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100010],q[100010],d[100010],tata[100010],sol[100010];
int main()
{
int n,nr=0;
fin>>n;
for(int i=1;i<=n;i++) fin>>v[i];
for(int i=1;i<=n;i++)
{
int st=1,dr=nr;
while(st<=dr)
{
int mid=(st+dr)/2;
if(v[q[mid]]>=v[i]) dr=mid-1;
else st=mid+1;
}
d[i]=d[q[st-1]]+1;
tata[i]=q[st-1];
if(st==nr+1) nr++;
q[st]=i;
}
int poz=0,cnt=0;
for(int i=1;i<=n;i++)
if(d[i]>d[poz]) poz=i;
for(int i=poz;i>0;i=tata[i]) sol[++cnt]=v[i];
fout<<cnt<<"\n";
for(int i=cnt;i;i--) fout<<sol[i]<<" ";
return 0;
}