A12408 | Isolation
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Find the number of ways to divide an array $a$ of $n$ integers into any number of disjoint non-empty segments so that, in each segment, there exist at most $k$ distinct integers that appear exactly once.
Since the answer can be large, find it modulo $998\,244\,353$ .
Since the answer can be large, find it modulo $998\,244\,353$ .
输入格式
The first line contains two space-separated integers $n$ and $k$ ( $1 \leq k \leq n \leq 10^5$ ) — the number of elements in the array $a$ and the restriction from the statement.
The following line contains $n$ space-separated integers $a_1, a_2, \ldots, a_n$ ( $1 \leq a_i \leq n$ ) — elements of the array $a$ .
The following line contains $n$ space-separated integers $a_1, a_2, \ldots, a_n$ ( $1 \leq a_i \leq n$ ) — elements of the array $a$ .
输出格式
The first and only line contains the number of ways to divide an array $a$ modulo $998\,244\,353$ .
输入输出样例
输入 #1
3 1 1 1 2
输出 #1
3
输入 #2
5 2 1 1 2 1 3
输出 #2
14
输入 #3
5 5 1 2 3 4 5
输出 #3
16
In the first sample, the three possible divisions are as follows.
- $[[1], [1], [2]]$
- $[[1, 1], [2]]$
- $[[1, 1, 2]]$
Division $[[1], [1, 2]]$ is not possible because two distinct integers appear exactly once in the second segment $[1, 2]$ .
- $[[1], [1], [2]]$
- $[[1, 1], [2]]$
- $[[1, 1, 2]]$
Division $[[1], [1, 2]]$ is not possible because two distinct integers appear exactly once in the second segment $[1, 2]$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted