Pagini recente » Cod sursa (job #3039038) | Cod sursa (job #3039049) | Cod sursa (job #2332438) | Cod sursa (job #1875620) | Cod sursa (job #538977)
Cod sursa(job #538977)
#include<iostream>
#include<fstream>
#include<ctime>
using namespace std;
int main()
{int sir[10],max[10],nr[10];
int n,i,maxi,subsir=0,d,z,k;
ifstream f1("subsir2.in");
ofstream f2("subsir2.out");
f1>>n;
for(i=1;i<=n;i++)
{f1>>sir[i];
max[i]=0;
}
max[1]=1;
for(i=2;i<=n;i++)
{maxi=0;
for(d=1;d<i;d++)
{if((sir[i]>sir[d])&&(max[d]>maxi)) maxi=max[d];
}
maxi++;
max[i]=maxi;
if(subsir<maxi) subsir=maxi;
}
f2<<subsir<<endl;
k=0;
z=0;
z=0;
k=0;
for(i=n;i>=1;i--)
{if(max[i]==subsir-k)
{z++;
nr[z]=i;
k++;
}
}
for(i=z;i>=1;i--)
{f2<<nr[i]<<" ";
}
return 0;
}