summaryrefslogtreecommitdiff
path: root/content/math/longestIncreasingSubsequence.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
commit98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch)
tree5113d5cc24d1ad5f93810b6442ce584a36950dc8 /content/math/longestIncreasingSubsequence.cpp
parentad3856a6b766087df0036de0b556f4700a6498c9 (diff)
parent8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff)
mzuenni tests
Diffstat (limited to 'content/math/longestIncreasingSubsequence.cpp')
-rw-r--r--content/math/longestIncreasingSubsequence.cpp17
1 files changed, 17 insertions, 0 deletions
diff --git a/content/math/longestIncreasingSubsequence.cpp b/content/math/longestIncreasingSubsequence.cpp
new file mode 100644
index 0000000..fcb63b4
--- /dev/null
+++ b/content/math/longestIncreasingSubsequence.cpp
@@ -0,0 +1,17 @@
+vector<int> lis(vector<ll>& a) {
+ int n = sz(a), len = 0;
+ vector<ll> dp(n, INF), dp_id(n), prev(n);
+ for (int i = 0; i < n; i++) {
+ int pos = lower_bound(all(dp), a[i]) - dp.begin();
+ dp[pos] = a[i];
+ dp_id[pos] = i;
+ prev[i] = pos ? dp_id[pos - 1] : -1;
+ len = max(len, pos + 1);
+ }
+ // reconstruction
+ vector<int> res(len);
+ for (int x = dp_id[len-1]; len--; x = prev[x]) {
+ res[len] = x;
+ }
+ return res; // indices of one LIS
+}