Pagini recente » Cod sursa (job #608344) | Statistici Comanescu Mircea (nightwach) | Istoria paginii utilizator/mrgere | Statistici Ivanoiu Stefan (Ivanoiu1234) | Cod sursa (job #1244765)
#include <fstream>
using namespace std;
ifstream f("in.in");
ofstream g("out.out");
int n,a[100],L[100],Max,x;
void afis()
{
g<<a[x]<<" ";
for(int i=x;i<=n;i++)
{
if(L[i]==Max)
{
for(int j=i+1;j<=n;j++)
{
if(L[j]==Max-1)
{
g<<a[j]<<" ";
Max--;
}
}
}
}
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a[i];
}
L[n]=1;
for(int i=n-1;i>=1;i--)
{
Max=0;
for(int j=i+1;j<=n;j++)
{
if(Max<L[j] && a[j]>a[i]) Max=L[j];
}
L[i]=Max+1;
}
Max=0;
int val=0;;
for(int i=n;i>=1;i--)
{
if(L[i]>Max) {Max=L[i];x=i;val++;}
}
g<<val<<endl;
afis();
return 0;
}