Pagini recente » Clasament pregatire2021_1 | Monitorul de evaluare | Diferente pentru rotatie-lexicografic-minima intre reviziile 24 si 23 | Clasament dupa rating | Cod sursa (job #2850764)
#include <fstream>
#include <algorithm>
#include <vector>
#define INF 1000000000
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n,v[100001],ind[100001],p[100001];
int dp[100001];
int main()
{
ios_base::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>v[i];
dp[i]=INF;
}
for(int i=1;i<=n;i++)
{
int j=upper_bound(dp+1,dp+1+n,v[i])-dp;
if(dp[j-1]<v[i] && v[i]<dp[j])
{
dp[j]=v[i];
ind[j]=i;
p[i]=ind[j-1];
}
}
int ans=0;
vector<int> rec;
for(int i=1;i<=n;i++)
{
if(dp[i]<INF)
{
ans=i;
}
}
cout<<ans<<'\n';
int p1=ind[ans];
while(p1!=0)
{
rec.push_back(v[p1]);
p1=p[p1];
}
for(int i=rec.size()-1;i>=0;i--)
cout<<rec[i]<<' ';
return 0;
}