Pagini recente » Cod sursa (job #2049405) | Cod sursa (job #1003175) | Cod sursa (job #2585268) | Istoria paginii runda/id123321 | Cod sursa (job #1860970)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int N=100000;
int lmax,lung[N],pred[N],v[N],n;
void sir(int p){
if(pred[p]!=0){
sir(pred[p]);
}
out<<v[p]<<" ";
}
int main()
{
in>>n;
int i,j;
for(i=0;i<n;i++)
in>>v[i];
for(i=1;i<=n;i++){
lmax=0;
for(j=1;j<i;j++){
if(v[j]<v[i]){
if(lung[j]>lmax){
lmax=lung[j];
pred[i]=j;
}
}
}
lung[i]=1+lmax;
}
int pmax=1;
for(i=2;i<=n;i++){
if(lung[i]>lung[pmax]){
pmax=i;
}
}
out<<lung[pmax]<<'\n';
sir(pmax);
return 0;
}