Pagini recente » Cod sursa (job #904509) | Cod sursa (job #2945777) | Cod sursa (job #2675854) | Cod sursa (job #2514313) | Cod sursa (job #3260819)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMAX = 100000;
int n;
int v[NMAX+1], len;
int dp[NMAX+1];
int pos[NMAX+1];
vector <int> ans;
int main()
{
fin >> n;
for(int i=1; i<=n; i++)
{
fin >> v[i];
if(v[i] > dp[len])
dp[++len] = v[i], pos[i] = len;
else
{
int ind = lower_bound(dp+1,dp+1+len,v[i])-dp;
dp[ind] = v[i];
pos[i] = ind;
}
}
fout << len << '\n';
for(int i=n; i>=1; i--)
{
if(pos[i] == len)
{
ans.push_back(v[i]);
len--;
}
}
int sz = ans.size();
for(int i=sz-1; i>=0; i--)
fout << ans[i] << ' ';
return 0;
}