Pagini recente » Cod sursa (job #3197164) | Cod sursa (job #43593) | Cod sursa (job #2759375) | Cod sursa (job #2480101) | Cod sursa (job #1043466)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
int n,x[100001],lis[1000001],nr[100001],i,j;
f>>n;
for(i=1;i<=n;i++) f>>x[i];
int maxx;
lis[n]=1;
int maxx2=1,mixx;
for(i=n-1;i>=1;i--)
{
maxx=0;
for(j=i+1;j<=n;j++)
{
if(x[i<=x[j]&&lis[j>maxx]) maxx=lis[j];
}
lis[i]=maxx+1;
if(maxx2<lis[i])
{
maxx2=lis[i];
mixx=i;
}
}
g<<maxx2<<'\n';
nr[n]=1;
for(i=n-1;i>=1;i--)
{
for(j=i+1;j<=n;j++)
{
if(lis[j]==lis[i]-1&&x[i]<=x[j])
{
nr[i]+=nr[j];
if(nr[i]==0) nr[i]=1;
}
}
}
bool ver;
g<<x[mixx]<<' ';
for(i=maxx2-1;i>=1;i--)
{
ver=1;
for(j=mixx+1;j<=n&&ver==1;j++)
{
if(lis[j]==i&&x[j]>=x[mixx])
{
mixx=j;
ver=0;
g<<x[mixx]<<' ';
}
}
}
return 0;
}