Pagini recente » Cod sursa (job #578890) | Cod sursa (job #124181) | Cod sursa (job #2144374) | Cod sursa (job #2215717) | Cod sursa (job #2386168)
#include <fstream>
using namespace std;
int n,i,v[1010],D[1010],maxim,P,T[1010],j,u,sol[1010],k;
int main (){
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
fin>>n;
for (i=1;i<=n;i++){
fin>>v[i];
}
n++;
v[n]=2000000000;
D[1]=1;
for (i=2;i<=n;i++){
maxim=0;
P=0;
for (j=1;j<i;j++){
if (v[j]<v[i]&&D[j]>maxim){
maxim=D[j];
P=j;
}
}
D[i]=maxim+1;
T[i]=P;
}
u=n;
while (u!=0){
sol[++k]=v[u];
u=T[u];
}
fout<<D[n]-1<<"\n";
for (i=k;i>=2;i--){
fout<<sol[i]<<" ";
}
return 0;
}