Pagini recente » Cod sursa (job #2012814) | Cod sursa (job #926460) | Cod sursa (job #1986790) | Cod sursa (job #1986789) | Cod sursa (job #2134738)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("subsir2.in");
ofstream fout("subsir2.out");
int n,i,j,nr,mx,rz,mn,id,ok,v[5005],pre[5005],lng[5005],da[5005],nu[5005];
bool mxm[5005];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
rz=n;
for(i=1;i<=n;i++)
{
mn=10000005;
if(lng[i]==0)
{
lng[i]=1;
pre[i]=0;
}
for(j=i+1;j<=n;j++)
if(v[j]>=v[i]&&v[j]<mn)
{
mxm[i]=1;
mn=v[j];
if(lng[i]+1<lng[j]||lng[j]==0)
{
lng[j]=lng[i]+1;
pre[j]=i;
}
if(lng[i]+1==lng[j]&&v[i]<v[pre[j]]) pre[j]=i;
}
if(mxm[i]==0&&lng[i]<rz) rz=lng[i];
}
fout<<rz<<"\n";
for(i=1;i<=n;i++)
if(mxm[i]==0)
{
nr=0; id=i;
while(id!=0)
{
nr++; nu[nr]=id;
id=pre[id];
}
if(nr==rz)
{
ok=0;
while(ok==0&&nr>0)
{
if(v[nu[nr]]<v[da[nr]]) ok=1;
if(v[nu[nr]]>v[da[nr]]) ok=-1;
nr--;
}
if(ok==1||da[0]==0)
{
da[0]=1;
for(j=1;j<=rz;j++)
da[j]=nu[j];
}
}
}
for(i=rz;i>=1;i--)
fout<<da[i]<<" ";
}