Cod sursa(job #2034322)
Utilizator | andrei contor andreicontor | Data | 7 octombrie 2017 18:27:36 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include<cstdio>
using namespace std;
int l[100001],v[100001],ma,i,k,j,n;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
l[n]=1;
for(i=n-1;i>=1;i--)
{
ma=0;
for(j=i+1;j<=n;j++)
if(v[i]<v[j]&&l[j]>ma)
ma=l[j];
l[i]=ma+1;
}
ma=0;
for(i=1;i<=n;i++)
if(l[i]>ma)
{
ma=l[i];
k=i;
}
printf("%d\n",ma);
printf("%d ",v[k]);
ma--;
for(i=k+1;i<=n;i++)
if(v[k]<v[i]&&l[i]==ma)
{
printf("%d ",v[i]);
ma--;
}
return 0;
}