Pagini recente » Cod sursa (job #2388663) | Cod sursa (job #318266) | Cod sursa (job #495654) | Cod sursa (job #381150) | Cod sursa (job #300183)
Cod sursa(job #300183)
#include<cstdio>
#include<vector>
using namespace std;
int N,v[1000005],best[1000005],t[1000005];
int maxim,pozitie;
vector <int> afis;
int main()
{
freopen("sir.in","r",stdin);
freopen("sir.out","w",stdout);
int i,j;
scanf("%d",&N);
for(i=1;i<=N;i++)
{
scanf("%d",&v[i]);
for(j=i-1;j>=1;j--)
if(v[i]>v[j] && best[i]<best[j]+1)
{
best[i]=best[j]+1;
t[i]=j;
}
if(best[i]>maxim) maxim=best[i],pozitie=i;
}
printf("%d\n",maxim + 1);
do
{
afis.push_back(v[pozitie]);
pozitie=t[pozitie];
}while(pozitie!=0);
for(i=afis.size() -1;i>=0;i--) printf("%d ",afis[i]);
printf("\n");
return 0;
}