Fix condition in suffix array test case

Author: lrvideckis

tests/library_checker_aizu_tests/strings/suffix_array_short.test.cpp

@@ -20,7 +20,7 @@ int main() {
     if (sz > 0) sz--;
     if (sa_inv[i] == 0) continue;
     for (int j = sa[sa_inv[i] - 1];
-      max(i, j) + sz < n && s[i + sz] == s[j + sz];)
+      max(i, j) + sz < sz(s) && s[i + sz] == s[j + sz];)
       sz++;
     lcp_kasai[sa_inv[i] - 1] = sz;
   }