Gym 100989L (DFS)

AbdelKader enjoys math. He feels very frustrated whenever he sees an incorrect equation and so he tries to make it correct as quickly as possible!

Given an equation of the form: A₁ o A₂ o A₃ o ... o A_n  =  0, where o is either + or -. Your task is to help AbdelKader find the minimum number of changes to the operators + and -, such that the equation becomes correct.

You are allowed to replace any number of pluses with minuses, and any number of minuses with pluses.

Input

The first line of input contains an integer N (2 ≤ N ≤ 20), the number of terms in the equation.

The second line contains N integers separated by a plus + or a minus -, each value is between 1 and 10⁸.

Values and operators are separated by a single space.

Output

If it is impossible to make the equation correct by replacing operators, print  - 1, otherwise print the minimum number of needed changes.

题意：给出了你一个数字n，和一个由n个数字以及n-1个加减运算符组成的算式，你可以把 ‘+’ 变成 ‘-’，或者把‘-’变成加‘+’。问你最少改变几个符号可以使算式等于0。注意：符号和数字之间用空格隔开。

思路：这道题可以用DFS来解决，枚举所有符号的改变情况，每个符号只有两种情况，改变或者不变。递归每个符号的两种情况，DFS（不变），DFS（改变），记录递归的层数，当递归到最后一个符号时判断运算结果是否符合要求，记录符合要求的最小改变次数。具体步骤看代码中的标注。

 #include<iostream>
 #include<cstdlib>
 #include<cstring>
 #include<cstdio>
 #include<string>
 #include<algorithm>
 #include<stack>
 #include<queue>
 #define ll long long
 #define inf 0x3f3f3f3f
 using namespace std;

 int minn;
 int n,num[],num1,num2;
 char str[];

 int compute() //计算结果是否为0
 {
     int it=,ans = num[];
     while(it < num2)
     {
         if(str[it] == '+')
             ans += num[it+];
         else
             ans -= num[it+];
         it++;
     }
     if(ans == ) return ;
     else return ;
 }

 void dfs(int times,int change) //times表示判断第几个符号，change表示改变了多少次
 {
     if(times >= num2) //如果已经判断完所有的符号了，就计算结果
     {
         if(change < minn && compute()) //如果改变的次数比之前记录的小且计算结果符合要求
         {
             minn = change; //就重新记录最小值
         }
         return;
     }

     dfs(times+,change); //递归不改变这个符号的额情况

     if(str[times] == '+') //改变符号
         str[times] = '-';
     else str[times] = '+';
     dfs(times+,change+); //递归改变符号的情况，改变数加1
     if(str[times] == '+') //回溯，将改变的的符号还原
     str[times] = '-';
     else str[times] = '+';
     return;
 }

 int main()
 {
     while(cin>>n)
     {
         num1=,num2=;
         minn = inf;

         for(int i=; i<=n*-; ++i) //注意输入方式，输入一个数字，一个运算符，总共2*n-1个，数字和字母之间有空格
         {
             if(i%==) // 如果是奇数位置，则输入数字
             {
                 scanf("%d",&num[num1++]);
                 getchar();//吸收空格
             }
             else scanf("%c",&str[num2++]);//输入运算符
         }
         dfs(,);
         if(minn == inf)
             cout<<"-1"<<endl;
         else
             cout<<minn<<endl;
     }
     return ;
 }