2017 ACM Arabella Collegiate Programming Contest Magical Bamboos

最新推荐文章于 2019-03-19 00:00:00 发布

Wang_128

最新推荐文章于 2019-03-19 00:00:00 发布

阅读量388

点赞数

CC 4.0 BY-SA版权

分类专栏： Codeforces ----其他

本文链接：https://blog.youkuaiyun.com/a664607530/article/details/79016866

----其他同时被 2 个专栏收录

216 篇文章

订阅专栏

Codeforces

140 篇文章

订阅专栏

本文探讨了一个有趣的算法问题——魔法竹林。在这个问题中，玩家需要通过特定的操作让所有竹子的高度变得一致。文章提供了完整的代码实现，并阐述了解题思路：通过对竹子高度进行排序并检查相邻竹子高度差是否为偶数来判断目标是否可达成。

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

In a magical forest, there exists N bamboos that don't quite get cut down the way you would expect.

Originally, the height of the ith bamboo is equal to hi. In one move, you can push down a bamboo and decrease its height by one, but this move magically causes all the other bamboos to increase in height by one.

If you can do as many moves as you like, is it possible to make all the bamboos have the same height?

Input

The first line of input is T – the number of test cases.

The first line of each test case contains an integer N (1 ≤ N ≤ 105) - the number of bamboos.

The second line contains N space-separated integers hi (1 ≤ hi ≤ 105) - the original heights of the bamboos.

Output

For each test case, output on a single line "yes” (without quotes), if you can make all the bamboos have the same height, and "no" otherwise.

Example

input
2
3
2 4 2
2
1 2

output
yes
no

题意：给你n个数，每次将一个数减一，其他数加一，问经过几次操作后这n个数能否都相同

解题思路：将n个数排序后，相邻两个数的差为偶数即可

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <string>  
#include <algorithm>  
#include <cmath>  
#include <map>  
#include <set>  
#include <stack>  
#include <queue>  
#include <vector>  
#include <bitset>  
#include <functional>  

using namespace std;

#define LL long long  
const int INF = 0x3f3f3f3f;

int n, h[100009];

int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int flag = 1;
		scanf("%d", &n);
		for (int i = 1; i <= n; i++) scanf("%d", &h[i]);
		sort(h + 1, h + 1 + n);
		for (int i = 2; i <= n; i++)
			if ((h[i] - h[i - 1]) % 2 != 0) flag = 0;
		if(!flag) printf("no\n");
		else printf("yes\n");
	}
	return 0;
}