Pagini recente » Cod sursa (job #1174396) | Cod sursa (job #715411) | Cod sursa (job #2457282) | Cod sursa (job #1898348) | Cod sursa (job #2452719)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100005], dp[100005], pre[100005], n;
void afisSubsir(int n) {
if(pre[n])
afisSubsir(pre[n]);
g << v[n] << ' ';
}
int main() {
f >> n;
for(int i = 1; i <= n; i++)
f >> v[i];
dp[1] = 1;
for(int i = 2; i <= n; i++) {
int maxim = 0, index = 0;
for(int j = 1; j < i; j++)
if(v[j] < v[i] && dp[j] > maxim) {
maxim = dp[j];
index = j;
}
dp[i] = maxim+1;
pre[i] = index;
}
g << dp[n] << '\n';
afisSubsir(n);
}