Pagini recente » Borderou de evaluare (job #825264) | Cod sursa (job #808684)
Cod sursa(job #808684)
#include <cstdio>
#include <algorithm>
using namespace std;
inline int next_int() {
int n = 0;
char c = getchar_unlocked();
while (!('0' <= c && c <= '9')) {
c = getchar_unlocked();
}
while ('0' <= c && c <= '9') {
n = n * 10 + c - '0';
c = getchar_unlocked();
}
return n;
}
const int MAX = 1 << 18;
int N, BIT[MAX];
int A[MAX], S[MAX];
int get(int index) {
int ans = 0;
while (index) {
ans = max(ans, BIT[index]);
index -= index & -index;
}
return ans;
}
void set(int index, int value) {
while (index <= N) {
BIT[index] = max(value, BIT[index]);
index += index & -index;
}
}
bool cmp(const int & a, const int & b) {
if (A[a] != A[b]) {
return A[a] < A[b];
}
return a > b;
}
int main() {
freopen("scmax.in", "r", stdin);
freopen("scmax.out", "w", stdout);
N = next_int();
for (int i = 1; i <= N; i++) {
A[i] = next_int();
S[i] = i;
}
sort(S + 1, S + N + 1, cmp);
for (int i = 1; i <= N; i++) {
set(S[i], get(S[i]) + 1);
}
printf("%d ", get(N));
return 0;
}