题意:2个狼人,其它都是好人,一个好人说谎,一个狼人说谎,求两个狼人。
思路:枚举狼人,最后求说谎的两个人是否一个是好人一个是狼人。
代码
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAX_N = 110;
int p[MAX_N], t[MAX_N];
int a[MAX_N], len = 0;
int n;
void solve() {
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
fill(p+1, p+1+n, 1);
p[i] = p[j] = -1;
len = 0;
for (int k = 1; k <= n; k++) {
if (p[abs(t[k])] * t[k] < 0) a[len++] = abs(k);
}
if (len == 2 && p[a[0]] + p[a[1]] == 0) {
printf("%d %d\n", i, j); return ;
}
}
}
printf("No Solution\n");
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &t[i]);
solve();
return 0;
}