Pagini recente » Cod sursa (job #1173472) | Cod sursa (job #276824) | Cod sursa (job #1773715) | Cod sursa (job #2136978) | Cod sursa (job #1803437)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,maxim,u,k,t[1000003],v[1000003],tt[1000003],x[1000003];
int main()
{
f>>n;
f>>v[1];
t[1]=1;
// maxim=v[1];
v[n+1]=2000000001;
for(i=2;i<=n+1;i++)
{
f>>v[i];
maxim=0;
for(j=1;j<i;j++)
{
if(v[i]>v[j]&&t[j]>maxim)
{
maxim=t[j];
tt[i]=j;
}
}
t[i]=maxim+1;
}
g<<t[n+1]-1<<'\n';
u=tt[n+1];
while(t[u]!=0)
{
x[++k]=v[u];
u=tt[u];
}
for(i=k;i>=1;i--)
g<<x[i]<<" ";
return 0;
}