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. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
DuongNeverAlone | 2023-10-16 07:37:47 | 339 | Initial revision (published) |
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | nik_exists | 130 |
| 9 | Proof_by_QED | 130 |
