Pagini recente » Cod sursa (job #1296673) | Cod sursa (job #1890281) | Cod sursa (job #341699) | Cod sursa (job #979600) | Cod sursa (job #2190378)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, m, i, j, v[100005], best[100005], lmax, pred[100005], sol[100005];
int main()
{
fin>>n;
best[1]=1;
for(i=1;i<=n;i++)
{
fin>>v[i];
j=i-1;
while(j>=0)
{
if(best[j]+1>best[i]&&v[j]<v[i])
{
pred[i]=j;
best[i]=best[j]+1;
}
j--;
}
lmax=max(best[i],lmax);
}
fout<<lmax<<'\n';
i=n;
while(best[i]!=lmax&&i>=1)
i--;
j=0;
while(pred[i]!=0)
{
j++;
sol[j]=v[i];
i=pred[i];
}
j++;
sol[j]=v[i];
for(i=lmax;i>=1;i--)
fout<<sol[i]<<' ';
return 0;
}