Pagini recente » Cod sursa (job #1760408) | Cod sursa (job #2714552) | Cod sursa (job #1058691) | Cod sursa (job #887953) | Cod sursa (job #1185705)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long v[100005],n,l[100005],p[100005],i,max1,poz,j;
void afis(int k)
{
if(v[k]!=0)
{
g<<v[k]<<" ";
afis(l[k]);
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>v[i];
for(i=n;i>=1;i--)
{
for(j=i+1;j<=n-p[i]+1;j++)
{
if(v[i]<v[j])
if(p[i]<p[j])
{
p[i]=p[j];
l[i]=j;
}
}
p[i]++;
if(p[i]>max1)
{
max1=p[i];
poz=i;
}
}
g<<max1<<"\n";
afis(poz);
return 0;
}