Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_DEPRECATE
- #include <iostream>
- #include <vector>
- #include <string>
- #include <map>
- #include <set>
- #include <algorithm>
- #define ull unsigned long long
- #define ll long long
- using namespace std;
- const int N = 1001;
- const ll INF = 1000ll * 1000 * 1000;
- //ll a[N];
- pair<int, int> d[N];
- int p[N];
- int dx[3] = { 2, 3, 6 };
- int main() {
- //freopen("input.txt", "r", stdin);
- //freopen("output.txt", "w", stdout);
- int n;
- cin >> n;
- vector<int> a(n);
- for (int i = 0; i < n; i++) {
- cin >> a[n - i - 1];
- }
- vector<int> d(n + 1, INF);
- d[0] = -INF;
- for (int i = 0; i < n; i++) {
- int j = int(upper_bound(d.begin(), d.end(), a[i]) - d.begin());
- if (d[j - 1] <= a[i] && a[i] <= d[j])
- d[j] = a[i];
- }
- int ans = 0;
- for (int i = 0; i <= n; i++) {
- if (d[i] != INF) {
- ans = i;
- }
- }
- cout << ans;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement