1128. N Queens Puzzle (20)

1128. N Queens Puzzle (20)

#include <iostream>
#include <cmath>
using namespace std;
bool Solve(int a[],int n)
{
    int i=1;
    while(i<=n)
    {
        for(int j=1;j<i;++j)
        {
            if(abs(a[j]-a[i])==abs(j-i)||a[j]==a[i]) return false;
        }
        ++i;
    }
    return true;
}
int main()
{
    int k=0;
    cin>>k;
    while(k--){
        int a[1000+1]={0},n=0;
        cin>>n;
        for(int i=1;i<=n;++i) cin>>a[i];
        bool ans=Solve(a,n);
        if(ans)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}