A12390 | Greedy Subsequences
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
For some array $c$ , let's denote a greedy subsequence as a sequence of indices $p_1$ , $p_2$ , ..., $p_l$ such that $1 \le p_1 < p_2 < \dots < p_l \le |c|$ , and for each $i \in [1, l - 1]$ , $p_{i + 1}$ is the minimum number such that $p_{i + 1} > p_i$ and $c[p_{i + 1}] > c[p_i]$ .
You are given an array $a_1, a_2, \dots, a_n$ . For each its subsegment of length $k$ , calculate the length of its longest greedy subsequence.
You are given an array $a_1, a_2, \dots, a_n$ . For each its subsegment of length $k$ , calculate the length of its longest greedy subsequence.
输入格式
The first line contains two integers $n$ and $k$ ( $1 \le k \le n \le 10^6$ ) — the length of array $a$ and the length of subsegments.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le n$ ) — array $a$ .
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le n$ ) — array $a$ .
输出格式
Print $n - k + 1$ integers — the maximum lengths of greedy subsequences of each subsegment having length $k$ . The first number should correspond to subsegment $a[1..k]$ , the second — to subsegment $a[2..k + 1]$ , and so on.
输入输出样例
输入 #1
6 4 1 5 2 5 3 6
输出 #1
2 2 3
输入 #2
7 6 4 5 2 5 3 6 6
输出 #2
3 3
In the first example:
- $[1, 5, 2, 5]$ — the longest greedy subsequences are $1, 2$ ( $[c_1, c_2] = [1, 5]$ ) or $3, 4$ ( $[c_3, c_4] = [2, 5]$ ).
- $[5, 2, 5, 3]$ — the sequence is $2, 3$ ( $[c_2, c_3] = [2, 5]$ ).
- $[2, 5, 3, 6]$ — the sequence is $1, 2, 4$ ( $[c_1, c_2, c_4] = [2, 5, 6]$ ).
In the second example:
- $[4, 5, 2, 5, 3, 6]$ — the longest greedy subsequences are $1, 2, 6$ ( $[c_1, c_2, c_6] = [4, 5, 6]$ ) or $3, 4, 6$ ( $[c_3, c_4, c_6] = [2, 5, 6]$ ).
- $[5, 2, 5, 3, 6, 6]$ — the subsequence is $2, 3, 5$ ( $[c_2, c_3, c_5] = [2, 5, 6]$ ).
- $[1, 5, 2, 5]$ — the longest greedy subsequences are $1, 2$ ( $[c_1, c_2] = [1, 5]$ ) or $3, 4$ ( $[c_3, c_4] = [2, 5]$ ).
- $[5, 2, 5, 3]$ — the sequence is $2, 3$ ( $[c_2, c_3] = [2, 5]$ ).
- $[2, 5, 3, 6]$ — the sequence is $1, 2, 4$ ( $[c_1, c_2, c_4] = [2, 5, 6]$ ).
In the second example:
- $[4, 5, 2, 5, 3, 6]$ — the longest greedy subsequences are $1, 2, 6$ ( $[c_1, c_2, c_6] = [4, 5, 6]$ ) or $3, 4, 6$ ( $[c_3, c_4, c_6] = [2, 5, 6]$ ).
- $[5, 2, 5, 3, 6, 6]$ — the subsequence is $2, 3, 5$ ( $[c_2, c_3, c_5] = [2, 5, 6]$ ).
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted