Misc/LIS.h

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00
• Link: https://hnoj.edu.vn/contest/hnoi2023v1/all
• Link: https://marisaoj.com/problem/276
• Link: https://oj.vnoi.info/problem/lis

Depends on

• template.h

Code

#include "../template.h"

const int N = 2e5 + 6;
vector<vector<int>> adj;
vector<int> a, ans;
set<int> s[N];

// AC: https://oj.vnoi.info/problem/lis
int LIS(vector<int> &a) {
    multiset<int> s;
    for (int x : a) {
        auto it = s.lower_bound(x);
        if (it != s.end()) {
            s.erase(it);
        }
        s.insert(x);
    }
    return s.size();
}

int __LIS(vector<int> &a) {
    vector<int> v;
    for (int x : a) {
        auto it = lower_bound(all(v), x);
        if (it != v.end()) {
            (*it) = min((*it), x);
        } else {
            v.push_back(x);
        }
    }
    return v.size();
}

// LIS on tree
// AC: https://marisaoj.com/problem/276
// AC: https://hnoj.edu.vn/contest/hnoi2023v1/all
void dfs(int u, int par) {
    for (int v : adj[u]) {
        if (v == par) continue;
        dfs(v, u);
        if (s[u].size() < s[v].size()) {
            swap(s[u], s[v]);
        }
        for (auto it : s[v]) {
            s[u].insert(it);
        }
    }
    auto it = s[u].lower_bound(a[u]);
    if (it != s[u].end()) {
        s[u].erase(it);
    }
    s[u].insert(a[u]);
    ans[u] = s[u].size();
}

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "Misc/LIS.h"

const int N = 2e5 + 6;
vector<vector<int>> adj;
vector<int> a, ans;
set<int> s[N];

// AC: https://oj.vnoi.info/problem/lis
int LIS(vector<int> &a) {
    multiset<int> s;
    for (int x : a) {
        auto it = s.lower_bound(x);
        if (it != s.end()) {
            s.erase(it);
        }
        s.insert(x);
    }
    return s.size();
}

int __LIS(vector<int> &a) {
    vector<int> v;
    for (int x : a) {
        auto it = lower_bound(all(v), x);
        if (it != v.end()) {
            (*it) = min((*it), x);
        } else {
            v.push_back(x);
        }
    }
    return v.size();
}

// LIS on tree
// AC: https://marisaoj.com/problem/276
// AC: https://hnoj.edu.vn/contest/hnoi2023v1/all
void dfs(int u, int par) {
    for (int v : adj[u]) {
        if (v == par) continue;
        dfs(v, u);
        if (s[u].size() < s[v].size()) {
            swap(s[u], s[v]);
        }
        for (auto it : s[v]) {
            s[u].insert(it);
        }
    }
    auto it = s[u].lower_bound(a[u]);
    if (it != s[u].end()) {
        s[u].erase(it);
    }
    s[u].insert(a[u]);
    ans[u] = s[u].size();
}

Back to top page