[실1] 14888 - 연산자 끼워넣기

#include <iostream>
using namespace std;

#define OPERATOR_COUNT 4

int n;
int arr_operand[1000]; // 수열 
int arr_operator[OPERATOR_COUNT];
int min_val = INT_MAX;
int max_val = INT_MIN;

void DFS(int result, int idx)
{
    if (idx == n)
    {
        if (result > max_val)
            max_val = result;

        if (result < min_val)
            min_val = result;

        return;
    }
    for (int i = 0; i < OPERATOR_COUNT; i++)
    {
        if (arr_operator[i] > 0)
        {
            arr_operator[i]--;
            int arr_val[]
            {
                result + arr_operand[idx],
                result - arr_operand[idx],
                result * arr_operand[idx],
                result / arr_operand[idx]
            };
            DFS(arr_val[i], idx + 1);
            arr_operator[i]++;
        }
    }
    return;
}

int main() 
{
    cin >> n;

    for (int i = 0; i < n; i++)
        cin >> arr_operand[i];

    for (int i = 0; i < OPERATOR_COUNT; i++)
        cin >> arr_operator[i];

    DFS(arr_operand[0], 1);
    cout << max_val << '\n';
    cout << min_val;
}