Pagini recente » Cod sursa (job #820192) | Cod sursa (job #1983789) | Cod sursa (job #361006) | Cod sursa (job #142760) | Cod sursa (job #1244769)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100010],L[100010],Max,x;
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;
g<<a[x]<<" ";int u=a[x]; Max--;
for(int i=x+1;i<=n;i++)
if(L[i]==Max && u<a[i])
{
g<<a[i]<<" ";
Max--;
u=a[i];
}
return 0;
}