Pagini recente » Cod sursa (job #323977) | Cod sursa (job #269868) | Cod sursa (job #1768394) | Cod sursa (job #2124190) | Cod sursa (job #2042206)
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
stack <int> s;
int v[100005],a[100005];
int main()
{
int n,i,j,maxx=0;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
a[1]=1;
for(i=2;i<=n;i++)
{
for(j=i-1;j>=1;j--)
{
if(v[i]>v[j] && a[j]>a[i])
{
a[i]=a[j];
}
}
a[i]++;
if(maxx<a[i])
maxx=a[i];
}
fout<<maxx<<'\n';
int cn=n;
int cm=maxx;
while(cn!=0)
{
if(a[cn]==cm)
{
cm--;
s.push(v[cn]);
}
cn--;
}
while(!s.empty())
{
fout<<s.top()<<" ";
s.pop();
}
return 0;
}