Base Station Sites（跳石头问题）

最新推荐文章于 2020-03-27 12:29:53 发布

Wonder__

最新推荐文章于 2020-03-27 12:29:53 发布

阅读量343

点赞数

本文链接：https://blog.youkuaiyun.com/Wonder__/article/details/79837941

版权

这是一个关于如何选择基站位置以确保至少覆盖指定数量站点的编程问题。给定候选基站位置列表，需要找到最短的基站间隔，使得至少有指定数量的站点被覆盖。通过二分查找算法来确定最佳基站间距。

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

Base Station Sites

时间限制: 1 Sec 内存限制: 128 MB
提交: 214 解决: 86
[ 提交][ 状态][ 讨论版][命题人: admin]

题目描述

5G is the proposed next telecommunications standards beyond the current 4G standards. 5G planning aims at higher capacity than current 4G, allowing a higher density of mobile broadband users, and supporting device-to- device, reliable, and massive wireless communications. A telecommunication company would like to install more base stations to provide better communication for customers. Due to the installation cost and available locations, the company can only install S (2 ≤ S ≤ L) base stations at L (2 ≤ L ≤ 100, 000) candidate locations. Since the base stations work in the same frequency band, they will interfere and cause severe performance degradation. To provide high quality communication experience to customers, the company would like to maximize the distance between the base stations so as to reduce the wireless interference among the base stations. Suppose the L candidate locations are in a straight line at locations P1, P2,..., PL (0 ≤ Pi ≤ 1, 000, 000) and the company wants to install S base stations at the L candidate locations. What is the largest minimum distance among the S base stations?

输入

The input data includes multiple test sets.
Each set starts with a line which specifies L (i.e., the number of candidate locations) and S (i.e., the number of base stations). The next line contains L space-separated integers which represent P1, P2,..., PL.
The input data ends “0 0”.

输出

For each set, you need to output a single line which should be the largest minimum distance among the base stations.

样例输入

5 3

2 3 9 6 11

4 3

1 4 9 10

0 0

样例输出

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int S,L,a[N];
int main()
{
while(scanf("%d%d",&L,&S)&&L+S)///输入候选位置的数量，基站的数量
{///并且l和s为0时结束输入
for(int i=0; i<L; i++) scanf("%d",&a[i]); ///可能选中的位置
sort(a,a+L);///从小到大排序，便于寻找位置
int l = 0, r = 1e6,mid;///左面，右面，中间
while(l<=r)///当左面小于右面时进行循环
{
mid = (l+r)>>1;///中间等于左右和的一半
int cnt = 1, now = 0;///now记录当前位置，cnt表示可以放置基站的数量
for(int i=1; i<L; i++)///遍历候选位置
{
if(a[i]-a[now]>=mid)///如果两者之间距离大于mid的话
{
now = i;///更新当前位置
cnt++;///可建立基站数+1
}
}
if(cnt>=S) l = mid + 1;///如果可建立基站数大于s，说明距离小了，调大距离
else r = mid - 1;///否则，调小距离
}
printf("%d\n",r);///或者l-1;
}
return 0;
}