Pagini recente » Cod sursa (job #88883) | Cod sursa (job #1768531) | Cod sursa (job #1120189) | Cod sursa (job #723533) | Cod sursa (job #2962384)
#include<fstream>
using namespace std;
ifstream F("subsir2.in");
ofstream G("subsir2.out");
int n,i,a[5001],l[5001],p[5001],m,j;
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=1e9,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(j=1,i=2;i<=n;++i)
if(l[i]<=l[j]&&a[i]<a[j]&&p[j]!=i)
j=i;
for(G<<l[j]<<'\n';j;G<<j<<' ',j=p[j]);
return 0;
}