判断两个条件矛盾关系

问题来源:PAT1089

//假定真话假话的人,然后遍历判断
//太强了  乘积作真假判定
//该题核心: 判断两个条件是否矛盾的算法
//https://blog.csdn.net/liuchuo/article/details/82560831?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522163782084516780271517348%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=163782084516780271517348&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-2-82560831.first_rank_v2_pc_rank_v29&utm_term=1089+%E7%8B%BC%E4%BA%BA%E6%9D%80-%E7%AE%80%E5%8D%95%E7%89%88&spm=1018.2226.3001.4187
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
    int n;
    cin >> n;
    vector<int> v(n + 1);
    for (int i = 1; i <= n; i++) cin >> v[i];  //正数好人,负数狼人
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            vector<int> lie, a(n + 1, 1);   //lie储存说谎角色编号 a角色类型数据储存: 平民为1,狼人反之-1
            a[i] = a[j] = -1;  //遍历选出两个狼人,确定狼人位置
            for (int k = 1; k <= n; k++)
                //这里是判断: 几号位置言行不一致,即该角色说谎
                if (v[k] * a[abs(v[k])] < 0) lie.push_back(k);   //储存的k值,说这句话的人的位置
            //只有两个人说谎,且一个是平民一个是狼人 (即a分别为1和-1)
            if (lie.size() == 2 && a[lie[0]] + a[lie[1]] == 0) {
                cout << i << " " << j;
                return 0;
            }
        }
    }
    cout << "No Solution";
    return 0;
}