ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board
Discussion of Problem
2165
. Cake Cutter
O(N^2 logN) Time
Posted by
Mickkie
13 Oct 2023 00:50
Although can be solved in O(N^3)
Here's the interesting paper: Optimal Area Triangulation
https://core.ac.uk/download/pdf/226134402.pdf
(haven't read yet)
Hint: Also include O(N^3) solution
© 2000–2024
Timus Online Judge Team
. All rights reserved.