Pagini recente » Cod sursa (job #2558031) | Cod sursa (job #1426803) | Cod sursa (job #1676962) | Cod sursa (job #2141893) | Cod sursa (job #2636310)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int dp[100005], v[100005], best, n,pre[100005];
void citire() {
fin >> n;
for(int i = 1; i <= n; i ++)
fin >> v[i];
}
void solve() {
dp[1] = 1;
for(int i = 2; i <= n; i++) {
for(int j = 1; j < i; j++)
if(v[j] < v[i] && dp[j]+1 > dp[i]) {
dp[i] = dp[j]+1;
pre[i] = j;
}
if(dp[i] > dp[best]) {
best = i;
}
}
}
void print(int x) {
if(x) {
print(pre[x]);
fout << v[x] << ' ';
}
}
void afis() {
fout << dp[best]+1 << '\n';
print(best);
}
int main() {
citire();
solve();
afis();
}