Pagini recente » Cod sursa (job #3318383) | Cod sursa (job #3317785) | Cod sursa (job #1358826) | Cod sursa (job #3318551) | Cod sursa (job #2386184)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int i,j,n,maxi,k,u,v[10010],d[10010],t[10010],a[10010];
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
d[1]=1;
v[++n]=1000000;
for(i=2;i<=n;i++){
maxi=0;
for(j=1;j<i;j++)
if(v[j]<v[i] && d[j]>maxi){
maxi=d[j];
k=j;
}
d[i]=maxi+1;
if(d[i]==1)
t[i]=0;
else
t[i]=k;
}
u=n;
i=0;
while(u!=0){
a[++i]=v[u];
u=t[u];
}
fout<<i-1<<"\n";
for(j=i;j>=2;j--)
fout<<a[j]<<" ";
return 0;
}