PTA甲级考试真题练习128——1128 N Queens Puzzle

题目

思路

水题

代码

#include <iostream>
#include <vector>
using namespace std;
vector<int> vec;
bool Judge(int _index) {
	for (int i = 0; i < _index; ++i) {
		if (vec[i] == vec[_index] || abs(vec[i] - vec[_index]) == abs(i - _index))
			return false;
	}
	return true;
}
bool init(int n) {
	bool flag = true;
	vec.resize(n);
	for (int i = 0; i < n; ++i) {
		cin >> vec[i];
		if (flag) 
			if (!Judge(i)) 	flag = false;
	}
	return flag;
}
int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		int num;
		cin >> num;
		init(num) ? cout << "YES"<<endl: cout << "NO" << endl;
		vec.clear();
	}
	return 0;
}