Pagini recente » Cod sursa (job #3177204) | Cod sursa (job #1088356) | Cod sursa (job #905294) | Cod sursa (job #655420) | Cod sursa (job #1193245)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int nmax = 100001;
int v[nmax] , lung[nmax] , pred[nmax];
void afisare(int i)
{
if(pred[i])
afisare(pred[i]);
out << v[i] << ' ';
}
int main()
{
int n , i , j , maxim , imax;
in >> n;
for(i = 1 ; i <= n ; i++)
in >> v[i];
maxim = 0;
for(i = 1 ; i <= n ; i++)
{
lung[i] = 0;
for(j = 1 ; j < i ; j++)
if(v[j] < v[i])
if(lung[j] > lung[i])
{
lung[i] = lung[j];
pred[i] = j;
}
lung[i]++;
if(lung[i] > maxim)
{
maxim = lung[i];
imax = i;
}
}
out << maxim << '\n';
afisare(imax);
out << '\n';
return 0;
}