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.
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 162 |
4 | nor | 153 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 151 |
6 | TheScrasse | 151 |
8 | Petr | 145 |
9 | pajenegod | 144 |
10 | orz | 143 |
A Classical Problem?
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.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
JianfengZhu | 2023-05-19 11:51:55 | 47 | Tiny change: 'the graph.' -> 'the graph.\n\nI don't know how to do it in $O(n \log n)$.' | |
en1 |
![]() |
JianfengZhu | 2023-05-19 11:51:17 | 205 | Initial revision (published) |
Name |
---|