I tried to solve this problem: Optimal insertion using persistent segment tree. It gives me MLE for some reasons that I don't understand. Could anyone help me. My submission: Code
Memory limit exceed using persistent segment tree
I tried to solve this problem: Optimal insertion using persistent segment tree. It gives me MLE for some reasons that I don't understand. Could anyone help me. My submission: Code
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | DuongForeverAlone | 2023-10-16 07:37:47 | 339 | Initial revision (published) |