CodingTest-solve/baekjoon_16637.cpp at main · sungchan1/CodingTest-solve · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include <iostream>
#include <cstdio>
#include <climits>
using namespace std;
char arr[20];
int max_cal = INT_MIN;
void sol(int n, int idx, int cal){
    int yes, no;
    yes = arr[idx]-'0';
    no = cal;
    if (idx > n - 1)
    {
        max_cal = max(max_cal, cal);
        //printf("%d\n", max_cal);
        return ;
    }

    //괄호 O
    if (idx + 2 < n)
    {
        if(arr[idx+1] == '+'){
            yes += (arr[idx+2]-'0');
        }
        else if(arr[idx+1] == '-'){
            yes -= (arr[idx+2]-'0');
        }
        else if(arr[idx+1] == '*'){
            yes *= (arr[idx+2]-'0');
        }

        if(idx!=0){
            if(arr[idx-1] == '+'){
                cal += yes;
            }
            else if(arr[idx-1] == '-'){
                cal -= yes;
            }
            else if(arr[idx-1] == '*'){
                cal *= yes;
            }
        }
        else{
            cal = yes;
        }
        sol(n, idx + 4, cal);
    }

    if(idx!=0){
        if(arr[idx-1] == '+'){
            no += (arr[idx]-'0');
        }
        else if(arr[idx-1] == '-'){
            no -= (arr[idx]-'0');
        }
        else if(arr[idx-1] == '*'){
            no *= (arr[idx]-'0');
        }
    }
    else
        no = (arr[idx]-'0');
    sol(n, idx + 2, no);

}

int main(void){
    int n;

    scanf("%d", &n);
    scanf("%s", arr);


    sol(n, 0, 0);

    printf("%d\n", max_cal);
}