[java 백준] 실버 1/ 14888번 연산자 끼워넣기

https://www.acmicpc.net/problem/14888

14888번: 연산자 끼워넣기

 

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
 
public class Main {
 
    public static int n;
    public static int m;
    public static int arr[];
    public static int add;
    public static int sub;
    public static int mul;
    public static int div;
    public static int min= Integer.MAX_VALUE;
    public static int max= Integer.MIN_VALUE;
 
    public static void DFS(int depth,int ans){
 
        if(depth==n){
            min=Math.min(ans,min);
            max=Math.max(ans,max);
        }else{
            if(add>0){
                add-=1;
                DFS(depth+1,ans+arr[depth]);
                add+=1;
            }
            if(sub>0) {
                sub -= 1;
                DFS(depth + 1, ans - arr[depth]);
                sub+=1;
            }
            if(mul>0){
                mul-=1;
                DFS(depth+1,ans*arr[depth]);
                mul+=1;
            }
            if(div>0){
                div-=1;
                DFS(depth+1,ans/arr[depth]);
                div+=1;
            }
        }
 
    }
 
    public static void main(String[]args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st ;
        n = Integer.parseInt(br.readLine());
        arr=new int[n];
 
 
 
 
        st=new StringTokenizer(br.readLine());
        for(int i=0;i<n;i++){
            arr[i]= Integer.parseInt(st.nextToken());
 
        }
 
 
        st=new StringTokenizer(br.readLine());
        add=Integer.parseInt(st.nextToken());
        sub=Integer.parseInt(st.nextToken());
        mul=Integer.parseInt(st.nextToken());
        div=Integer.parseInt(st.nextToken());
 
        DFS(1,arr[0]);
        System.out.println(max);
        System.out.println(min);
 
    }
 
 
 
}