Pagini recente » Borderou de evaluare (job #2563757) | Borderou de evaluare (job #1902783) | Borderou de evaluare (job #2191217) | Borderou de evaluare (job #1220973) | Cod sursa (job #3231752)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,ans;
int v[100005];
bool o[100005];
int dp[100005];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
if(v[j]>v[i])
{
dp[j]=max(dp[j],dp[i]+1);
ans=max(dp[j],ans);
}
fout<<ans+1<<"\n";
for(int i=n;i>=1;i--)
if(dp[i]==ans)
{
o[i]=1;
ans--;
if(ans==(-1)) break;
}
for(int i=1;i<=n;i++)
if(o[i])fout<<v[i]<<" ";
return 0;
}