Cod sursa(job #822957)
| Utilizator | Data | 24 noiembrie 2012 12:20:49 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include<stdio.h>
int main(){
int r,max,v[100],l[100],n,poz,i;
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;r=0;
int j;
for(i=n-1;i>=1;i--){
max=0;
for(j=i+1;j<=n;j++)
if(v[i]<v[j]&&l[j]>max){
max=l[j];
l[i]=l[j]+1;
if(l[i]>r){
r=l[i];
poz=i;
}
}
if(max==0)
l[i]=1;
}
printf("%d\n",r);
for(i=poz;i<=n;i++)
if(l[i]==r){
printf("%d ",v[i]);
r--;
}
return 0;
}
