AcWing 1621. N 皇后问题
原题链接
简单
#include<bits/stdc++.h>
#define eb emplace_back
using namespace std;
const int N = 1010;
int state[N];
int tt;
void Judge()
{
bool flag = true;
for( int i = 1 ; i <= tt ; i ++)
{
int j;
for( j = 1 ; j <= i-1 ; j ++)
{
if( state[j] == state[i] || abs( state[j] - state[i] )==abs ( j - i ) )
{ flag = false ; break ;}
}
if(!flag)break;
}
if(flag)cout << "YES" << '\n';
else cout << "NO" << '\n';
}
int main()
{
int n;
cin >> n;
for(int i = 1;i <= n; i ++ )
{
cin >> tt;
memset(state , 0 , sizeof(state));
for(int j = 1 ;j <= tt ; j ++){int y; cin >> y; state[j] = y;}
Judge();
}
return 0;
}