Pagini recente » Cod sursa (job #364700) | Cod sursa (job #3146193) | Cod sursa (job #927149) | Cod sursa (job #1166316) | Cod sursa (job #419473)
Cod sursa(job #419473)
#include<fstream>
using namespace std;
int n,v[5001],l[5001],p[5001];
int main()
{ifstream f("subsir2.in");
ofstream g("subsir2.out");
f>>n;
int i,j,k,min=201,ml;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
i=1;
while(p[n]==0 && i<n)
{if(v[i]<v[n])
p[n]=1;
i++;}
for(i=n-1;i>=1;i--)
{for(j=i+1;j<=n;j++)
if(v[j]>v[i] && l[j]>l[i])
l[i]=l[j];
l[i]++;
j=1;
while(p[i]==0 && j<i)
{if(v[j]<v[i])
p[i]=1;
j++;}
}
for(i=1;i<=n;i++)
if(l[i]<min && p[i]==0)
{min=l[i];
k=i;}
else
if(l[i]==min && p[i]==0 && v[i]<v[k])
{min=l[i];
k=i;}
g<<min<<'\n'<<k<<" ";
min--;
while(min)
{for(i=k+1;i<=n;i++)
{ml=1000000;
if(l[i]==min && v[i]>v[k] && ml>v[i])
{ml=v[i];
j=i;}
}
g<<j<<" ";
k=j;
min--;
}
f.close();
g.close();
return 0;}