[IOI2000] 邮局

题目 邮局是一个关于村庄和邮局的问题。给定一些村庄的位置和邮局的数量，目标是选择邮局的位置，使得每个村庄到最近的邮局的距离总和最小。解决这个问题可以使用前缀和优化的暴力算法，枚举每个村庄和邮局的组合。该算法的时间复杂度为O(n^4)。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* *2* [P4767 [IOI2000]邮局（四边形不等式）](https://blog.csdn.net/gyp0205/article/details/123991528)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 50%"]
- *3* [[IOI2000] 邮局](https://blog.csdn.net/weixin_30892037/article/details/97949145)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]