Zero Array CodeForces - 1201B

这篇博客讨论了CodeForces的B. Zero Array问题,涉及通过操作使数组所有元素变为零的可能性。博主提供了一个简单的思路:若数组总和为奇数,则无法构造;若最大值大于总和减去最大值,也为无解;否则,可以找到解决方案。示例和数据范围也被考虑在内。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

B. Zero Array

You are given an array a1,a2,…,an.

In one operation you can choose two elements ai and aj (i≠j) and decrease each of them by one.

You need to check whether it is possible to make all the elements equal to zero or not.

Input
The first line contains a single integer n (2≤n≤105) — the size of the array.

The second line contains n integers a1,a2,…,an (1≤ai≤109) — the elements of the array.

Output
Print “YES” if it is possible to make all elements zero, otherwise print “NO”.

Examples

input
4
1 1 2 2

output
YES

input
6
1 2 3 4 5 6

output
NO

Note
In the first example, you can make all elements equal to zero in 3 operations:

Decrease a1 and a2,
Decrease a3 and a4,
Decrease a3 and a4
In the second example, one can show that it is impossible to make all elements equal to zero.

一道简单的思路题:

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值