Pagini recente » Borderou de evaluare (job #303910) | Cod sursa (job #3265410) | Borderou de evaluare (job #2598046) | Borderou de evaluare (job #2200375) | Cod sursa (job #300177)
Cod sursa(job #300177)
#include <cstdio>
#include <vector>
using namespace std;
int N,v[100005],best[100005],t[100005],pozitie,maxim;
vector <int> afis;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.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;
}