Compilare: user.cpp: In function ‘int main()’: user.cpp:27:27: warning: suggest parentheses around ‘-’ in operand of ‘&’ [-Wparentheses] nlg+= int(!(i & i - 1)); ^ user.cpp:36:35: warning: capture of variable ‘p’ with non-automatic storage duration [enabled by default] sort(ssfx, ssfx + n, [lg, p](int a, int b) { return (p[lg - 1][a] == p[lg - 1][b]) ? (p[lg - 1][min(n, a + (1 << lg - 1))] < p[lg - 1][min(n, b + (1 << lg - 1))]) : (p[lg - 1][a] < p[lg - 1][b]); } ); ^ user.cpp:8:5: note: ‘int p [18][120005]’ declared here int p[LG + 1][SPQR], ssfx[SPQR]; ^ user.cpp: In lambda function: user.cpp:36:125: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] sort(ssfx, ssfx + n, [lg, p](int a, int b) { return (p[lg - 1][a] == p[lg - 1][b]) ? (p[lg - 1][min(n, a + (1 << lg - 1))] < p[lg - 1][min(n, b + (1 << lg - 1))]) : (p[lg - 1][a] < p[lg - 1][b]); } ); ^ user.cpp:36:164: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] sort(ssfx, ssfx + n, [lg, p](int a, int b) { return (p[lg - 1][a] == p[lg - 1][b]) ? (p[lg - 1][min(n, a + (1 << lg - 1))] < p[lg - 1][min(n, b + (1 << lg - 1))]) : (p[lg - 1][a] < p[lg - 1][b]); } ); ^ user.cpp: In function ‘int main()’: user.cpp:38:115: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if (i > 0 && (p[lg - 1][ssfx[i - 1]] != p[lg - 1][ssfx[i]] || p[lg - 1][min(n, ssfx[i - 1] + (1 << lg - 1))] != p[lg - 1][min(n, ssfx[i] + (1 << lg - 1))])) ^ user.cpp:38:161: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses] if (i > 0 && (p[lg - 1][ssfx[i - 1]] != p[lg - 1][ssfx[i]] || p[lg - 1][min(n, ssfx[i - 1] + (1 << lg - 1))] != p[lg - 1][min(n, ssfx[i] + (1 << lg - 1))])) ^