Compilare: user.cpp: In function ‘void make_sa()’: user.cpp:40:31: warning: capture of variable ‘pos’ with non-automatic storage duration [enabled by default] sort(sa, sa + n, [lg, pos](const int &a, const int &b) { ^ user.cpp:11:5: note: ‘int pos [19][400005]’ declared here int pos[LG + 1][NMAX], ^ user.cpp: In lambda function: user.cpp:42:50: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] (pos[lg - 1][min(a + (1 << lg - 1), n)] < pos[lg - 1][min(b + (1 << lg - 1), n)]) : ^ user.cpp:42:91: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] (pos[lg - 1][min(a + (1 << lg - 1), n)] < pos[lg - 1][min(b + (1 << lg - 1), n)]) : ^ user.cpp: In function ‘void make_sa()’: user.cpp:47:101: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if (pos[lg - 1][sa[i]] != pos[lg - 1][sa[i - 1]] || pos[lg - 1][min(n, sa[i] + (1 << lg - 1))] != pos[lg - 1][min(n, sa[i - 1] + (1 << lg - 1))]) ^ user.cpp:47:151: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if (pos[lg - 1][sa[i]] != pos[lg - 1][sa[i - 1]] || pos[lg - 1][min(n, sa[i] + (1 << lg - 1))] != pos[lg - 1][min(n, sa[i - 1] + (1 << lg - 1))]) ^ user.cpp:24:9: warning: unused variable ‘p’ [-Wunused-variable] int p; ^ user.cpp: In function ‘void make_ap()’: user.cpp:52:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0, p = 0; i < v.size(); ++i) ^ user.cpp:53:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j <= v[i].size(); ++j, ++p) ^ user.cpp: In function ‘void trick()’: user.cpp:82:51: warning: capture of variable ‘lcv’ with non-automatic storage duration [enabled by default] sort(sorted_lcp.rbegin(), sorted_lcp.rend(), [lcv](const int &a, const int &b) { ^ user.cpp:12:5: note: ‘int lcv [400005]’ declared here lcv[NMAX], ^ user.cpp: In function ‘int main()’: user.cpp:139:29: warning: operation on ‘np’ may be undefined [-Wsequence-point] str[np++] = 256 + np; } ^