CSES · 1145

Increasing Subsequence

This C++ solution uses longest increasing subsequence for CSES 1145 Increasing Subsequence. Read the reasoning, inspect the code, or try your own test case below.

1145Dynamic programmingLongest increasing subsequenceC++23 lines
Solution132of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Longest increasing subsequence

title is Increasing Subsequence; its required LIS length matches the patience-sorting implementation.

Dynamic programming

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

Longest_Increasing_Subsequence.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n; cin >> n;
        vector<int> v(n);
        for (int i = 0; i < n; i++) cin >> v[i];
        vector<int> ans;
        for (int i = 0; i < n; i++) {
            if (ans.empty() || v[i] > ans.back()) {
                ans.push_back(v[i]);
            } else {
                int pos = lower_bound(ans.begin(), ans.end(), v[i]) - ans.begin();
                ans[pos] = v[i];
            }
        }
        cout << ans.size() << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.