Pagini recente » Cod sursa (job #1032434) | Cod sursa (job #3127355) | Cod sursa (job #808690) | Cod sursa (job #808668)
Cod sursa(job #808668)
#include <cstdio>
#include <algorithm>
using namespace std;
inline int next_int() {
int d;
scanf("%d", &d);
return d;
}
int MAX = 100001;
int N, A[MAX], BIT[MAX], LIS[MAX];
pair<int, int> S[MAX];
int get(int index) {
int ans = 0;
while (index > 0) {
ans = max(ans, BIT[index]);
index -= index & -index;
}
return ans;
}
void set(int index, int value) {
while (index < MAX) {
BIT[index] = max(value, BIT[index]);
index += index & -index;
}
}
bool cmp(const pair<int, int>&p1, const pair<int, int>&p2) {
if (p1.first != p2.first) {
return p1.first < p2.first;
}
return p2.second < p1.second;
}
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] = make_pair(A[i], i);
}
sort(S + 1, S + N + 1, cmp);
for (int i = 1; i <= N; i++) {
set(S[i].second, get(S[i].second) + 1);
}
printf("%d ", get(N));
return 0;
}