Pagini recente » Cod sursa (job #2005289) | Cod sursa (job #933005) | Cod sursa (job #2759962) | Cod sursa (job #2592078) | Cod sursa (job #2045107)
#include <fstream>
using namespace std;
ifstream f ("subsir2.in");
ofstream g ("subsir2.out");
int n,k,v[5001],b[5001],c[5001],i,j,ma,nr,a;
int main()
{
f>>n;
ma=0;
for(i=1;i<=n;++i)
{
f>>v[i];
}
for(i=n;i>=1;--i)
{
b[i]=1;
for(j=i;j<=n;++j)
{
if(v[i]<v[j]){
b[i]=b[j]+1;
if(b[i]>ma)
break;
}
}
if(b[i]>ma)
ma=b[i];
}
g<<ma<<'\n';
for(i=1;i<=n;++i)
{
a=i;
if(b[i]==ma)
{
for(j=i+1;j<=n;++j)
if(b[i]==b[j]+1)
a=j-1;
ma--;
g<<v[i]<<" ";
}
i=a;
}
return 0;
}