Follow me 挑战程序与设计

最新推荐文章于 2024-08-24 09:00:00 发布

啥事的发生都发生的费

最新推荐文章于 2024-08-24 09:00:00 发布

阅读量426

点赞数 1

本文链接：https://blog.youkuaiyun.com/acm_dream/article/details/70213643

版权

本文探讨了萨鲁曼军队中palantir的有效部署策略，旨在确保每一名士兵都在特定范围内装备有至少一个palantir。通过算法设计，确定了最小数量的palantir分配方案。

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

Saruman's Army

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9887		Accepted: 4972

Description

Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the troops. Each palantir has a maximum effective range of R units, and must be carried by some troop in the army (i.e., palantirs are not allowed to “free float” in mid-air). Help Saruman take control of Middle Earth by determining the minimum number of palantirs needed for Saruman to ensure that each of his minions is within R units of some palantir.

Input

The input test file will contain multiple cases. Each test case begins with a single line containing an integer R, the maximum effective range of all palantirs (where 0 ≤ R ≤ 1000), and an integer n, the number of troops in Saruman’s army (where 1 ≤ n ≤ 1000). The next line contains n integers, indicating the positions x₁, …, x_n of each troop (where 0 ≤ x_i ≤ 1000). The end-of-file is marked by a test case with R = n = −1.

Output

For each test case, print a single integer indicating the minimum number of palantirs needed.

Sample Input

0 3
10 20 20
10 7
70 30 1 7 15 20 50
-1 -1

Sample Output

2
4

Hint

In the first test case, Saruman may place a palantir at positions 10 and 20. Here, note that a single palantir with range 0 can cover both of the troops at position 20.

In the second test case, Saruman can place palantirs at position 7 (covering troops at 1, 7, and 15), position 20 (covering positions 20 and 30), position 50, and position 70. Here, note that palantirs must be distributed among troops and are not allowed to “free float.” Thus, Saruman cannot place a palantir at position 60 to cover the troops at positions 50 and 70.

这道题也想了很长时间，最后思路是先排序，从最左边一个数a[j]开始，找在a[j]+R范围内距a[j]最远的一个点，再从这一点找到另一半R范围内最远的点，此为一个标记点。

#include <iostream>
#include <cstring>

#define mem(a,b) memset(a,b,sizeof(a))

using namespace std;

int main()
{
    int N,R;
    while(cin>>R>>N)
    {
        if (R==-1&&N==-1) break;
        int a[1009],temp;
        mem(a,0);
        for (int i=0;i<N;i++)
        {
            cin>>temp;
            a[temp]++;
        }
        int b[1009],flag=0;
        for (int i=0;i<1009;i++)
        {
            if (a[i])
            {
                b[flag++]=i;
            }
        }
        int sum=0;
       // for (int i=0;i<flag;i++) cout<<b[i]<<' ';
        for (int i=0;i<flag;)
        {
            int Left_min=b[i],k;
            for (k=i+1;b[k]<=Left_min+R;k++){}
            //cout<<"k:"<<k<<' '<<b[k]<<endl;
            int j=k-1;
            for (j;b[j]<=b[k-1]+R;j++){}
            //cout<<"j: "<<j<<endl<<endl;
            i=j;
            sum++;
        }
        cout<<sum<<endl;
    }
    return 0;
}