Pagini recente » Cod sursa (job #2228038) | Cod sursa (job #558858) | Cod sursa (job #2890874) | Cod sursa (job #2324684) | Cod sursa (job #2258381)
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int lis[10000][10000];
int n,i,j,x,l=1,i2,b;
int main()
{
f>>n>>x;
lis[1][1]=x;
for(i=2; i<=n; i++)
{
f>>x;
b=0;
for(j=1; j<=l &&b==0; j++)
{
if(lis[j][j]==x)
b=2;
else
if(lis[j][j]>x)
b=1;
}
if(b==0)
{
for(i2=1; i2<=j-1;i2++)
lis[j][i2]=lis[j-1][i2];
lis[j][j]=x;
l++;
}
else
if(b==1)
{
for(i2=1; i2<=j-2;i2++)
lis[j-1][i2]=lis[j-2][i2];
lis[j-1][j-1]=x;
}
}
g<<l<<"\n";
for(i=1; i<=l;i++)
g<<lis[l][i]<<" ";
return 0;
}