diff options
| author | MZuenni <michi.zuendorf@gmail.com> | 2023-01-11 11:15:50 +0100 |
|---|---|---|
| committer | MZuenni <michi.zuendorf@gmail.com> | 2023-01-11 11:15:50 +0100 |
| commit | 61cac9c0febbb5440b99e22770d917bf3a63c405 (patch) | |
| tree | 98b7dc3b77ada4cffe5b81daded5516b941f28ec /math/longestIncreasingSubsequence.cpp | |
| parent | fd1f2b36e95c03625297b7b8cba3b1a04a0cc0ed (diff) | |
dont use .size()
Diffstat (limited to 'math/longestIncreasingSubsequence.cpp')
| -rw-r--r-- | math/longestIncreasingSubsequence.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/math/longestIncreasingSubsequence.cpp b/math/longestIncreasingSubsequence.cpp index a4a8211..c2c5f3e 100644 --- a/math/longestIncreasingSubsequence.cpp +++ b/math/longestIncreasingSubsequence.cpp @@ -1,5 +1,5 @@ vector<int> lis(vector<int> &seq) { - int n = seq.size(), lisLength = 0, lisEnd = 0; + int n = sz(seq), lisLength = 0, lisEnd = 0; 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, |