We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 0c7666b commit 22dae66Copy full SHA for 22dae66
library/data_structures/uncommon/permutation_tree.hpp
@@ -50,7 +50,7 @@ struct perm_tree {
50
if (!empty(ch[u]) && touches(ch[u].back(), v)) {
51
p[u].mn_num = min(p[u].mn_num, p[v].mn_num);
52
p[u].len += p[v].len;
53
- ch[u] += v;
+ ch[u].push_back(v);
54
v = u;
55
st.pop_back();
56
continue;
0 commit comments