Pagini recente » Cod sursa (job #1973884) | Cod sursa (job #1427900) | Cod sursa (job #2634568) | Cod sursa (job #2978148) | Cod sursa (job #2210757)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,i,j,m,p,k,u,t[100010],sol[100010],v[100010],l[100010];
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
v[++n]=2000000010;
l[1]=1;
for(i=2;i<=n;i++){
m=0;
for(j=1;j<i;j++){
if(v[j]<v[i] && v[j]>m){
m=l[j];
p=j;
}
}
if(m!=0){
l[i]=m+1;
t[i]=p;
}else{
l[i]=1;
t[i]=0;
}
}
fout<<l[n]-1<<"\n";
u=n;
while(u!=0){
sol[++k]=v[u];
u=t[u];
}
for(;k>=2;k--){
fout<<sol[k]<<" ";
}
return 0;
}