1148 Werewolf - Simple Version (20 分)【难度: 一般 / 思维 枚举】

https://pintia.cn/problem-sets/994805342720868352/problems/1038429808099098624

#include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
int main(void)
{
    
    
	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> a(n+1,1);
			vector<int> ans;
			a[i]=-1,a[j]=-1;
			for(int k=1;k<=n;k++)
			{
    
    
				if(v[k]*a[abs(v[k])]<0) ans.push_back(k);
			}
			if(ans.size()==2&&a[ans[0]]+a[ans[1]]==0) 
			{
    
    
				cout<<i<<" "<<j;
				return 0;
			}
		}
	}
	cout<<"No Solution";
	return 0;
}