Cod sursa(job #419473)

Utilizator LorienNedelcu Ana-Florentina Lorien Data 17 martie 2010 15:55:43
Problema Subsir 2 Scor 58
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.83 kb
#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;}