PAT 甲级1128. N Queens Puzzle (20) 逻辑

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main()
{ 
    int k, n;
    cin >> k;
    for(int i = 0; i < k; i++){
        cin >> n;
        vector<int> v(n);
        bool flag = true;
        for(int j = 0; j < n; j++){
            cin >> v[j];
            for(int t = 0; t < j; t++){
                if(v[t] == v[j] || abs(j - t) == abs(v[j] - v[t])){ flag = false; break;}
            }
        }
    cout << (flag == true ? "YES\n" : "NO\n");
    }
    return 0;
}