Pagini recente » Cod sursa (job #1216958) | Cod sursa (job #595007) | Cod sursa (job #1055727) | Cod sursa (job #508655) | Cod sursa (job #2038960)
#include <fstream>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int n,i,j,mi,p,l[50001],v[50001],t[50001];
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
for(i=0;i<=n;++i)
l[i]=999999999;
v[0]=-999999999;
l[n]=1;
t[n]=n;
for(i=n-1;i>=0;--i)
{
mi=999999999;
for(j=i+1;j<=n;++j)
{ if(v[i]<v[j])
{
if(v[j]<mi)
{
mi=v[j];
if(l[i]>l[j])
{
l[i]=l[j]+1;
t[i]=j;
}
}}}
if(l[i]==999999999)
{
l[i]=1;
t[i]=i;
}
}
p=0;
while(p!=t[p])
{
g<<t[p]<<" ";
p=t[p];
}
return 0;
}