Pagini recente » Cod sursa (job #1948212) | Cod sursa (job #2890635) | Cod sursa (job #1216348) | Cod sursa (job #285162) | Cod sursa (job #2519390)
#include <fstream>
#include <vector>
using namespace std;
int n;
int v[100001];
long long dp[100001],l=0;
vector<int> ans;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>v[i];
dp[i]=2000000000;
}
for(int i=1;i<=n;i++)
{
for(int j=l;j>=0;j--)
{
if(dp[j]<v[i] && v[i]<dp[j+1])
{
dp[j+1]=v[i];
if(j==l) l++;
}
}
}
cout<<l<<"\n";
for(int i=l;i>=1;i--)
{
ans.push_back(dp[i]);
for(int j=i;j>=0;j--)
{
if(dp[i]>dp[j])
{
i=j+1;
break;
}
}
}
for(int i=ans.size()-1;i>=0;i--)
{
cout<<ans[i]<<" ";
}
return 0;
}