A9059 | Yaroslav and Permutations
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Yaroslav has an array that consists of $n$ integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.
Help Yaroslav.
Help Yaroslav.
输入格式
The first line contains integer $n$ $(1<=n<=100)$ — the number of elements in the array. The second line contains $n$ integers $a_{1},a_{2},...,a_{n}$ $(1<=a_{i}<=1000)$ — the array elements.
输出格式
In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise.
输入输出样例
输入 #1
1 1
输出 #1
YES
输入 #2
3 1 1 2
输出 #2
YES
输入 #3
4 7 7 7 7
输出 #3
NO
In the first sample the initial array fits well.
In the second sample Yaroslav can get array: $1$ , $2$ , $1$ . He can swap the last and the second last elements to obtain it.
In the third sample Yarosav can't get the array he needs.
In the second sample Yaroslav can get array: $1$ , $2$ , $1$ . He can swap the last and the second last elements to obtain it.
In the third sample Yarosav can't get the array he needs.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted