Pagini recente » Borderou de evaluare (job #3118045) | Cod sursa (job #1386437) | Cod sursa (job #1304861) | Cod sursa (job #822441) | Cod sursa (job #1360285)
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "scmax";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif
const int INF = (1 << 30);
const int NMAX = 100000 + 5;
int N, sol;
int A[NMAX];
int T[NMAX];
int S[NMAX];
int DP[NMAX];
int main() {
int i, j, k;
freopen(inputFile.c_str(), "r", stdin);
freopen(outputFile.c_str(), "w", stdout);
scanf("%d", &N);
for(i = 1; i <= N; i++) {
scanf("%d", &A[i]);
T[i] = INF;
j = lower_bound(T + 1, T + i + 1, A[i]) - T;
T[j] = A[i];
DP[i] = j;
sol = max(sol, DP[i]);
}
for(i = N, j = INF, k = sol; i >= 1; i--)
if(DP[i] == k && A[i] < j) {
S[k] = A[i];
j = A[i];
k--;
}
printf("%d\n", sol);
for(i = 1; i <= sol; i++)
printf("%d ", S[i]);
return 0;
}