A12196 | Increasing Frequency
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given array $a$ of length $n$ . You can choose one segment $[l, r]$ ( $1 \le l \le r \le n$ ) and integer value $k$ (positive, negative or even zero) and change $a_l, a_{l + 1}, \dots, a_r$ by $k$ each (i.e. $a_i := a_i + k$ for each $l \le i \le r$ ).
What is the maximum possible number of elements with value $c$ that can be obtained after one such operation?
What is the maximum possible number of elements with value $c$ that can be obtained after one such operation?
输入格式
The first line contains two integers $n$ and $c$ ( $1 \le n \le 5 \cdot 10^5$ , $1 \le c \le 5 \cdot 10^5$ ) — the length of array and the value $c$ to obtain.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 5 \cdot 10^5$ ) — array $a$ .
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 5 \cdot 10^5$ ) — array $a$ .
输出格式
Print one integer — the maximum possible number of elements with value $c$ which can be obtained after performing operation described above.
输入输出样例
输入 #1
6 9 9 9 9 9 9 9
输出 #1
6
输入 #2
3 2 6 2 6
输出 #2
2
In the first example we can choose any segment and $k = 0$ . The array will stay same.
In the second example we can choose segment $[1, 3]$ and $k = -4$ . The array will become $[2, -2, 2]$ .
In the second example we can choose segment $[1, 3]$ and $k = -4$ . The array will become $[2, -2, 2]$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted