fix

Author: lrvideckis

library/strings/suffix_array/suffix_array_short.hpp

@@ -17,7 +17,7 @@ auto sa_short(const auto& s) {
   for (int j = 1; j <= n; j *= K) {
     vi x(sa_inv);
     auto cmp = [&](int i1, int i2) {
-      rep (k, 0, K) {
+      rep(k, 0, K) {
         int a = i1 + j * k < n ? x[i1 + j * k] : -1;
         int b = i2 + j * k < n ? x[i2 + j * k] : -1;
         if (a != b) return a < b;
@@ -26,16 +26,16 @@ auto sa_short(const auto& s) {
     };
     sort(all(sa), cmp);
     sa_inv[sa[0]] = 0;
-    rep(i, 1, n)
-      sa_inv[sa[i]] = sa_inv[sa[i - 1]] + cmp(sa[i - 1], sa[i]);
+    rep(i, 1, n) sa_inv[sa[i]] =
+      sa_inv[sa[i - 1]] + cmp(sa[i - 1], sa[i]);
   }
-  int sz = 0;
+  int l = 0;
   rep(i, 0, n) {
-    if (sz > 0) sz--;
+    if (l > 0) l--;
     if (sa_inv[i] == 0) continue;
     int j = sa[sa_inv[i] - 1];
-    while(max(i, j) + sz < n && s[i + sz] == s[j + sz];) sz++;
-    lcp[sa_inv[i] - 1] = sz;
+    while (max(i, j) + l < n && s[i + l] == s[j + l]) l++;
+    lcp[sa_inv[i] - 1] = l;
   }
   return tuple{sa, sa_inv, lcp};
 }

tests/library_checker_aizu_tests/strings/suffix_array_short.test.cpp

@@ -10,7 +10,7 @@ int main() {
   string s;
   cin >> s;
   auto [sa, sa_inv, lcp] = sa_short(vi(all(s)));
-  rep (i, 0, sz(s)) {
+  rep(i, 0, sz(s)) {
     assert(sa[sa_inv[i]] == i);
     assert(sa_inv[sa[i]] == i);
   }