← 查看本卷题目
组合题6 个小题
已作答 0 / 6
#include <algorithm>#include <cstdio>#include <cstring>#define ll long longint n, k;int a[200007];int ans[200007];int main() {    scanf("%d%d", &n, &k);    for (int i = 1; i <= n; ++i) {        scanf("%d", &a[i]);    }    std::sort(a + 1, a + n + 1);    n = std::unique(a + 1, a + n + 1) - a - 1;    for (int i = 1, j = 0; i <= n; ++i) {        for (; j < i && a[i] - a[j + 1] > k; ++j)            ;        ans[i] = ans[j] + 1;    }    printf("%d\n", ans[n]);    return 0;}
第 22 题判断题原卷 1.5 分

当输入为 3 1 3 2 1 时,输出结果为 22。( )

填写答案