1148 Werewolf - Simple Version

这题我觉得真的有点烦，我想了半天还是没全对。。。还是参考大神的。。。

#include <iostream>
#include <stdlib.h>
#include <string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include <unordered_map>
using namespace std;

int main(){
    int n;
    vector<int> arr(101);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> arr[i + 1];
    }
    int w1 = -1, w2 = -1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (j == i) {
                continue;
            }
            else {
                vector<int> lier, wolf(n + 1, 1);
                wolf[i] = wolf[j] = -1;

                for (int k = 1; k <= n; k++) {
                    if (arr[k] * wolf[abs(arr[k])] < 0) {
                        lier.push_back(k);
                    }
                }

                if (lier.size() == 2 && wolf[lier[0]] + wolf[lier[1]] == 0) {
                    w1 = i;
                    w2 = j;
                    goto p1;

                }

            }
        }
    }

p1:
    if (w1 ==-1) {
        cout << "No Solution" << endl;
    }
    else {
        cout << w1 << ' ' << w2 << endl;
    }
    
    system("pause");
};