Pagini recente » Cod sursa (job #1894440) | Cod sursa (job #1154043) | Cod sursa (job #2003775) | Cod sursa (job #1574256) | Cod sursa (job #2277462)
#include <iostream>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <fstream>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int n, i, nmax, j, poz[100002], k, lg[100002], v[100002];
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
f >> n;
for(i = 1; i <= n; i++)
f >> v[i];
lg[n] = 1;
poz[n] = -1;
for(i = n - 1; i >= 1; i--)
{
lg[i] = 1;
poz[i] = -1;
for(j = i + 1; j <= n; j++)
{
if(v[i] < v[j] && lg[i] < lg[j] + 1)
{
lg[i] = lg[j] + 1;
poz[i] = j;
if(lg[i] > nmax)
{
nmax = lg[i];
k = i;
}
}
}
}
g << nmax << "\n";
while(k != -1)
{
g << v[k] << " ";
k = poz[k];
}
return 0;
}