Pagini recente » Cod sursa (job #727428) | Cod sursa (job #1985769) | Cod sursa (job #548730) | Cod sursa (job #653570) | Cod sursa (job #2958545)
#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;
int main()
{
for(F>>n,i=1;i<=n;F>>a[i++]);
for(l[n]=1,i=n-1;i;l[i]=l[i]==n?1:l[i],--i)
for(m=1e6,l[i]=n,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(m=a[1],k=1,i=2;i<=n&&l[i]<=l[1];++i)
if(a[i]<m)
m=a[i],k=i;
for(i=k,G<<l[i]<<'\n';i;G<<i<<' ',i=p[i]);
return 0;
}