Pagini recente » Cod sursa (job #1923935) | Cod sursa (job #2224618) | Cod sursa (job #2176075) | Cod sursa (job #1870890) | Cod sursa (job #2005399)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, i, j, nr, v[100003], in;
unsigned long mx;
deque <int> l[100002];
int main () {
fin >> n;
for (i = 1; i <= n; i++)
fin >> v[i];
for (i = 1; i <= n; i++)
{
for (j = 1; j < i; j++)
if (v[j] < v[i] && l[i].size() < l[j].size())
l[i]=l[j];
l[i].push_back(v[i]);
}
mx = l[1].size();
for (i = 1; i <= n; i++)
if (l[i].size() > mx)
{
mx = l[i].size();
in = i;
}
fout << mx << "\n";
for (j = 0; j < l[in].size(); j++)
fout << l[in][j] << " ";
/*cout << n << "\n";
for (i = 1; i <= n; i++)
{
for (j = 0; j < l[i].size(); j++)
cout << l[i][j] << " ";
cout << "\n";
}*/
}