Pagini recente » Cod sursa (job #2801023) | Cod sursa (job #1289497) | Cod sursa (job #1364181) | Cod sursa (job #1059639) | Cod sursa (job #2457691)
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
long long v[100001],l[100001],pred[100001],ans[100001];
void subsir(int p){
if(pred[p]!=0){
subsir(pred[p]);
}
cout<<v[p]<<" ";
}
int main()
{
int n,maxim=1,pozmax;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>v[i];
l[i]=1;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<i; j++)
{
if(v[i]>v[j])
{
if(l[i]<l[j]+1)
{
l[i]=l[j]+1;
pred[i]=j;
}
}
}
}
for(int i=1; i<=n; i++)
{
if(l[i]>maxim)
{
maxim=l[i];
pozmax=i;
}
}
cout<<maxim<<'\n';
subsir(pozmax);
//cout<<i;
return 0;
}