summaryrefslogtreecommitdiff
path: root/math/longestIncreasingSubsequence.cpp
diff options
context:
space:
mode:
authormzuenni <michi.zuendorf@gmail.com>2023-01-10 11:40:09 +0100
committermzuenni <michi.zuendorf@gmail.com>2023-01-10 11:40:09 +0100
commitfd1f2b36e95c03625297b7b8cba3b1a04a0cc0ed (patch)
treeb143619750b90fbfa45a98be9ea56904d1a7129d /math/longestIncreasingSubsequence.cpp
parent8faa84ca282d51e9ce4fef535e68325adabcebad (diff)
change whitespaces
Diffstat (limited to 'math/longestIncreasingSubsequence.cpp')
-rw-r--r--math/longestIncreasingSubsequence.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/math/longestIncreasingSubsequence.cpp b/math/longestIncreasingSubsequence.cpp
index 357ebcd..a4a8211 100644
--- a/math/longestIncreasingSubsequence.cpp
+++ b/math/longestIncreasingSubsequence.cpp
@@ -3,7 +3,7 @@ vector<int> lis(vector<int> &seq) {
vector<int> L(n), L_id(n), parents(n);
for (int i = 0; i < n; i++) {
int pos = upper_bound(L.begin(), L.begin() + lisLength,
- seq[i]) - L.begin();
+ seq[i]) - L.begin();
L[pos] = seq[i];
L_id[pos] = i;
parents[i] = pos ? L_id[pos - 1] : -1;