Pagini recente » Cod sursa (job #656965) | Cod sursa (job #843916) | Cod sursa (job #3235200) | Cod sursa (job #842028) | Cod sursa (job #2396479)
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int x[100005],z[100005],p[100005],n,k=1;
stack <int> stiva;
void citire()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>x[i];
}
void prelucrare()
{
int i,j;
z[1]=x[1];
p[1]=1;
for(i=2; i<=n; i++)
{
j=1;
while( x[i] > z[j] && j<k)
j++;
if(x[i]>z[j])
{
k++;
z[k]=x[i];
p[i]=k;
}
else
{
p[i]=j;
z[j]=x[i];
}
}
}
void afisare()
{
fout << k << "\n";
int j=n;
while(k){
while(j!=k)
j--;
stiva.push(x[j]);
k--;
}
while(!stiva.empty()){
fout << stiva.top()<< " ";
stiva.pop();
}
}
int32_t main()
{
citire();
prelucrare();
afisare();
return 0;
}