Pagini recente » Cod sursa (job #1532130) | Cod sursa (job #2284046) | Cod sursa (job #2495474) | Cod sursa (job #1969973) | Cod sursa (job #1465155)
#include <iostream>
#include <fstream>
#define l 100001
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[l],b[l],c[l],n,m,i,j;
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>a[i];
b[1]=1;
for(i=2;i<=n;i++){
m=0;
for(j=1;j<i;j++)
if(a[i]>a[j] and m<b[j])m=b[j];
b[i]=m+1;
}
//am facut b
//acum sol
m=1;
for(i=2;i<=n;i++)
if(b[m]<b[i])m=i;
c[b[m]]=a[m];
j=b[m];n=b[m];
g<<n<<'\n';
while(b[m]>1){
i=m-1;
while(a[i]>a[m] or (b[i]!=b[m]-1)) i--;
m=i;j--;c[j]=a[m];
}
for(i=1;i<=n;i++)
g<<c[i]<<" ";
}