JianfengZhu's blog

By JianfengZhu, history, 18 months ago, In English

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)$$$.

Full text and comments »

  • Vote: I like it
  • +58
  • Vote: I do not like it

By JianfengZhu, history, 2 years ago, In English
  • Have you thought about the tasks in IOI 2022?
  • How many tasks did you solve?
  • What's your favourate task, and why?

Full text and comments »

  • Vote: I like it
  • +48
  • Vote: I do not like it