Pagini recente » Cod sursa (job #2052190) | Cod sursa (job #110975) | Cod sursa (job #3268650) | Cod sursa (job #1557023) | Cod sursa (job #2958529)
#include<fstream>
using namespace std;
ifstream F("subsir2.in");
ofstream G("subsir2.out");
int n,i,a[5001],l[5001],p[5001],m,j,k,t,d[5001],c[5001],r;
bool b[5001];
int main()
{
for(F>>n,i=1;i<=n;F>>a[i++]);
for(l[n]=1,p[n]=n,i=n-1;i;l[i]=l[i]==n?1:l[i],--i)
for(m=1e6,l[i]=n,p[i]=i,j=i+1;j<=n;++j)
if(a[j]>=a[i]&&a[j]<=m)
if(m=a[j],l[i]>=l[j]+1)
l[i]=l[j]+1,p[i]=j;
//for(i=1;i<=n;G<<i<<' '<<a[i]<<' '<<l[i]<<' '<<p[i]<<'\n',++i);
for(r=n+1,i=1;i<=n;++i)
if(!b[i]) {
for(m=0,c[++m]=i,b[i]=1,j=i;j!=p[j];j=p[j],c[++m]=j,b[j]=1);
if(m<r)
for(r=m,j=1;j<=r;d[j]=c[j],++j);
}
for(G<<r<<'\n',i=1;i<=r;G<<d[i++]<<' ');
return 0;
}