Pagini recente » Cod sursa (job #776571) | Cod sursa (job #468386) | Cod sursa (job #1389283) | Cod sursa (job #1316622) | Cod sursa (job #2280067)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100002],e[100002],p[100002],k=1;
int main()
{
f>>n;
f>>a[0];
e[0]=a[0];
p[0]=1;
for(int i=1;i<n;i++)
{
f>>a[i];
if(a[i]<=e[k-1])
{ int j=k-1;
while(a[i]<=e[j])
j--;
e[j+1]=a[i];
p[i]=p[j+1];
}
else
{ k++;
e[k-1]=a[i];
p[i]=k;
}
}
g<<k<<endl;
int aux=k;
k=0;
for(int i=n-1;i>=0 && aux>0;i--)
if(p[i]==aux)
{
e[k++]=a[i];
aux--;
}
for(int i=k-1;i>=0;i--)
g<<e[i]<<" ";
return 0;
}