| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
You are given a permutation of $$$n$$$. Build an undirected graph of $$$n$$$ nodes. There is an edge $$$(i,j)$$$ if and only if $$$i<j$$$ and $$$p_i < p_j$$$. Please find the maximum matching of the graph.
I don't know how to do it in $$$O(n \log n)$$$.
Auto comment: topic has been updated by JianfengZhu (previous revision, new revision, compare).
https://mirror.codeforces.com/gym/103627/problem/D is basically that. I only have polylog solutions, but I cited some sources that claim O(n log log n) solutions.
Thanks very much!
I gave ChatGPT this. then it gives me this. Code with a bit of explanation Um have no idea whether it is correct or not xd
Not only is it too slow, but it's also wrong and I think it's due to its sqrt ""optimisation"". I instantly hacked it with the permutation
1 5 3 8 4 2 9 7 6 10.Don't rely on ML tools for code. They're mistake generators.