【Luogu P6902】[ICPC2014 WF] Surveillance（倍增，贪心）

最新推荐文章于 2025-04-12 07:00:00 发布

t14

最新推荐文章于 2025-04-12 07:00:00 发布

阅读量439

点赞数 1

分类专栏：贪心文章标签：算法贪心算法

本文链接：https://blog.youkuaiyun.com/t14zack/article/details/126819873

版权

该博客介绍了如何解决一个国际保护和控制组织（ICPC）的监控问题，即如何用最少的相机覆盖其总部建筑的所有墙壁。问题转换为在环形序列上寻找最少的线段来覆盖至少一半的序列。博客提出了使用贪心策略结合倍增算法优化，将时间复杂度降低到O(nlogn)的方法，并给出了详细的思路和代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

题目描述

The International Corporation for Protection and Control (ICPC) develops efficient technology for, well, protection and control. Naturally, they are keen to have their own headquarters protected and controlled. Viewed from above, the headquarters building has the shape of a convex polygon. There are several suitable places around it where cameras can be installed to monitor the building. Each camera covers a certain range of the polygon sides (building walls), depending on its position. ICPC wants to minimize the number of cameras needed to cover the whole building.

输入格式

The input consists of a single test case. Its first line contains two integers $n$ and $k$ ( $\le n \le 10^6$ and $\le k \le 10^6$ ), where $n$ is the number of walls and $k$ is the number of possible places for installing cameras. Each of the remaining $k$ lines contains two integers $a_ i$ and $b_ i$ ( $\le a_ i, b_ i \le n$ ). These integers specify which walls a camera at the $i^{th}$ place would cover. If