CF div2 a b c

最新推荐文章于 2022-08-05 12:24:18 发布

天天爆零

最新推荐文章于 2022-08-05 12:24:18 发布

阅读量668

点赞数

分类专栏：水题文章标签：算法

本文链接：https://blog.csdn.net/fbher/article/details/79369333

版权

给定n个点的坐标，求至少删除多少个点，使得剩余点的集合直径不超过d。通过枚举左端点，找出最优解。另外两个问题分别涉及动态规划求解改变数字到1的最小代价，以及找到字母子集下字典序最大的字符串。

摘要由CSDN通过智能技术生成

A. Points on the line
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

We’ve got no test cases. A big olympiad is coming up. But the problemsetters’ number one priority should be adding another problem to the round.

The diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1, 3, 2, 1} is 2.

Diameter of multiset consisting of one point is 0.

You are given n points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed d?
Input

The first line contains two integers n and d (1 ≤ n ≤ 100, 0 ≤ d ≤ 100) — the amount of points and the maximum allowed diameter respectively.

The second line contains n space separated integers (1 ≤ xi ≤ 100) — the coordinates of the points.
Output

Output a single integer — the minimum number of points you have to remove.
Examples
Input
Copy

3 1
2 1 4

Output

Input
Copy

3 0
7 7 7

Output

Input
Copy

6 3
1 3 4 6 9 10

Output

Note

In the first test case the optimal strategy is to remove the point with coordinate 4. The remaining points will have coordinates 1 and 2, so the diameter will be equal to 2 - 1 = 1.

In the second test case the diameter is equal to 0, so its is unnecessary to remove any points.

In the third test case the optimal strategy is to remove points with coordinates 1, 9 and 10. The remaining points will have coordinates 3, 4 and 6, so the diameter will be equal to 6 - 3 = 3.
题意:
给你一个点的集合,问你最少要去掉多少个点,可以使点的集合任意两个点的距离不大于d.
思路:
我们保留的点肯定是一段段的,所以我们只要枚举左端点就行
code:

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<string.h>
#include<set>
#include<stdlib.h>
#define INF 0x3f3f3f
using namespace std;
typedef long long LL;
int arr[110], n, d,ans;
int main()
{
    cin >> n >> d;
    for (int i =