1089 狼人杀-简单版 (20分)

#include <math.h>
#include <vector>
#include <iostream>
using namespace std;

int main()
{
    int n;
    cin>>n;
    vector <int> say(n+1);
    for(int i=1;i<=n;i++)
        cin>>say[i];
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            vector <int> lie, a(n+1,1);
            a[i]=a[j]=-1;
            for(int k=1;k<=n;k++)
               if(say[k]*a[abs(say[k])]<0)
                   lie.push_back(k);
            if(lie.size()==2&&a[lie[0]]+a[lie[1]]==0)
            {
                cout<<i<<" "<<j<<endl;
                return 0;
            }
        }
    }
    cout<<"No Solution"<<endl;
    return 0;
}