Pagini recente » Cod sursa (job #2129035) | Cod sursa (job #2695981) | Cod sursa (job #1965362) | Cod sursa (job #1842958) | Cod sursa (job #627879)
Cod sursa(job #627879)
#include<cstdio>
#include<vector>
using namespace std;
int n;
vector <long long int>L[100001];
int main()
{
int i, j, maxim, poz;
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
scanf("%d", &n);
for(i = 1; i <= n; i++)
{
long long int x;
scanf("%lld", &x);
L[i].push_back(x);
for(j = 1; j <= i; j++)
{
int s = L[j].size() - 1;
if(L[j][s] < x)
L[j].push_back(x);
}
}
maxim = L[1].size();
poz = 1;
for(i = 2; i <= n; i++)
if(maxim < L[i].size())
{
maxim = L[i].size();
poz = i;
}
printf("%d\n", maxim);
for(i = 0; i < L[poz].size(); i++)
printf("%lld ", L[poz][i]);
return 0;
}