Algorithm/BOJ14888_AddOperator.cpp at master · forza-js/Algorithm · 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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
//
//  main.cpp
//  BOJ14888_AddOperator
//
//  Created by 신지식 on 2018. 9. 25..
//  Copyright © 2018년 Shin Ji Sik. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <vector>
#include <limits.h>

using namespace std;

int n;
vector<int> v;
int oper[4]; //+ - * /
int maximum = INT_MIN;
int minimum = INT_MAX;

void cal(int idx, int prev){
    if(idx == n - 1){
        maximum = max(maximum, prev);
        minimum = min(minimum, prev);

        return;
    }
    for(int i = 0; i < 4; i++){
        if(oper[i] != 0){
            oper[i]--;
            if(i == 0) cal(idx + 1, prev + v[idx+1]);
            if(i == 1) cal(idx + 1, prev - v[idx+1]);
            if(i == 2) cal(idx + 1, prev * v[idx+1]);
            if(i == 3) cal(idx + 1, prev / v[idx+1]);
            oper[i]++;
        }
    }
}

int main(){
    cin >> n;

    for(int i = 0; i < n; i++){
        int num;
        cin >> num;
        v.push_back(num);
    }
    for(int i = 0; i < 4; i++)
        cin >> oper[i];

    cal(0, v[0]);
    printf("%d\n%d\n", maximum, minimum);
}

/* SWEA
int n;
int t;
vector<int> v;
int oper[4]; //+ - * /
int maximum;
int minimum;

void cal(int idx, int prev){
    if(idx == n - 1){
        maximum = max(maximum, prev);
        minimum = min(minimum, prev);

        return;
    }
    for(int i = 0; i < 4; i++){
        if(oper[i] != 0){
            oper[i]--;
            if(i == 0) cal(idx + 1, prev + v[idx+1]);
            if(i == 1) cal(idx + 1, prev - v[idx+1]);
            if(i == 2) cal(idx + 1, prev * v[idx+1]);
            if(i == 3) cal(idx + 1, prev / v[idx+1]);
            oper[i]++;
        }
    }
}

int main(){
    cin >> t;
    for(int tt = 1; tt <= t; tt++){
        cin >> n;

        minimum = INT_MAX;
        maximum = INT_MIN;
        v.clear();

        for(int i = 0; i < 4; i++)
            cin >> oper[i];

        for(int i = 0; i < n; i++){
            int num;
            cin >> num;
            v.push_back(num);
        }

        cal(0, v[0]);

        printf("#%d %d\n", tt, maximum - minimum);
    }
}
*/