Pagini recente » Cod sursa (job #16134) | Cod sursa (job #2761011) | Cod sursa (job #1122671) | Cod sursa (job #1583661) | Cod sursa (job #1039882)
#include <fstream>
using namespace std;
int L[100];
int main()
{
ifstream f("a.in");
ofstream g("a.out");
double a[5001];
int i,j,n,lmax=0,v[5001],sol[5001],k,lmin=0;
f>>n;
for(i=0;i<n;i++)
f>>a[i];
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
if(a[i]>a[j]&&L[i]<L[j])
{
L[i]=L[j];
v[i]=j;
}
L[i]++;
if(L[i]==1)
v[i]=-1;
if(L[i]>lmax)
{
lmax=L[i];
k=i;
}
}
for(j=k,i=0;j!=-1;j=v[j],i++)
sol[i]=j+1,lmin++;
g<<lmin<<endl;
for(j=i-1;j>=0;j--)
g<<sol[j]<<" ";
return 0;
}