Pagini recente » Cod sursa (job #2375883) | Cod sursa (job #1159841) | Cod sursa (job #1177392) | Cod sursa (job #271512) | Cod sursa (job #2807853)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[1007],x[1007],t[1007],n,i,j,s,p,u,m,k,b[1001];
bool l[1000001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
x[1]=1;
p=1;
s=1;
for(i=2;i<=n;i++)
{
p=1;
u=s;
while(p<=u)
{m=(u+p)/2;
if(a[i]>a[x[m]])
p=m+1;
else
u=m-1;
}
if(p>s)
{
s++;
}
x[p]=i;
} g<<s<<'\n';
for(i=1;i<=s;i++)
g<<a[x[i]]<<" ";
return 0;
}