This repository has been archived by the owner on Dec 7, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
geangsak_1.cpp
95 lines (89 loc) · 2.39 KB
/
geangsak_1.cpp
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
#include <climits>
#include <iostream>
#include <stdio.h>
using namespace std;
int tableMax[20][20], tableMin[20][20], n = 0;
int max(int a, int b) { return a > b ? a : b; }
int min(int a, int b) { return a < b ? a : b; }
int main() {
char in[50];
cin >> in;
while (in[n] != 0) {
if (n % 2 == 0) {
tableMax[n / 2][n / 2] = in[n] - '0';
tableMin[n / 2][n / 2] = in[n] - '0';
} else {
tableMax[n / 2 + 1][n / 2] = in[n];
tableMin[n / 2 + 1][n / 2] = in[n];
}
n++;
}
n = n / 2 + 1;
for (int k = 0; k < n; k++) {
int n1 = n - 1 - k;
for (int i = 0; i < n1; i++) {
int maxn = INT_MIN;
int minn = INT_MAX;
int temp;
for (int j = 0; j <= k; j++) {
switch (tableMax[i + 1 + j][i + j]) {
case '+':
temp = tableMax[i][i + j] + tableMax[i + 1 + j][i + 1 + k];
break;
case '-':
temp = tableMax[i][i + j] - tableMax[i + 1 + j][i + 1 + k];
break;
case '*':
temp = tableMax[i][i + j] * tableMax[i + 1 + j][i + 1 + k];
break;
}
minn = min(minn, temp);
maxn = max(maxn, temp);
switch (tableMax[i + 1 + j][i + j]) {
case '+':
temp = tableMin[i][i + j] + tableMax[i + 1 + j][i + 1 + k];
break;
case '-':
temp = tableMin[i][i + j] - tableMax[i + 1 + j][i + 1 + k];
break;
case '*':
temp = tableMin[i][i + j] * tableMax[i + 1 + j][i + 1 + k];
break;
}
minn = min(minn, temp);
maxn = max(maxn, temp);
switch (tableMax[i + 1 + j][i + j]) {
case '+':
temp = tableMax[i][i + j] + tableMin[i + 1 + j][i + 1 + k];
break;
case '-':
temp = tableMax[i][i + j] - tableMin[i + 1 + j][i + 1 + k];
break;
case '*':
temp = tableMax[i][i + j] * tableMin[i + 1 + j][i + 1 + k];
break;
}
minn = min(minn, temp);
maxn = max(maxn, temp);
switch (tableMax[i + 1 + j][i + j]) {
case '+':
temp = tableMin[i][i + j] + tableMin[i + 1 + j][i + 1 + k];
break;
case '-':
temp = tableMin[i][i + j] - tableMin[i + 1 + j][i + 1 + k];
break;
case '*':
temp = tableMin[i][i + j] * tableMin[i + 1 + j][i + 1 + k];
break;
}
minn = min(minn, temp);
maxn = max(maxn, temp);
}
tableMax[i][i + 1 + k] = maxn;
tableMin[i][i + 1 + k] = minn;
}
}
// cout << "Min : " << tableMin[0][n - 1] << endl;
// cout << "Max : " << tableMax[0][n - 1] << endl;
cout << tableMax[0][n - 1];
}