-
Notifications
You must be signed in to change notification settings - Fork 0
/
사칙연산.cpp
43 lines (40 loc) · 1.08 KB
/
사칙연산.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
#include <vector>
#include <string>
#include <cstring>
using namespace std;
int dp[101][101][2],inf=9e8;
vector<string> arr;
int sol(int l,int r,int k){
int& ret = dp[l][r][k];
if(ret!=-1) return ret;
if(k){
ret=-inf;
for(int i=l;i<=r;i++){
int lv,rv;
lv = l>i-1 ? stoi(arr[2*l]) : sol(l,i-1,1);
if(i+1>r) rv = stoi(arr[2*r+2]);
else if(arr[2*i+1]=="+") rv = sol(i+1,r,1);
else rv = sol(i+1,r,0);
if(arr[2*i+1]=="+") ret=max(lv+rv,ret);
else ret=max(lv-rv,ret);
}
}else{
ret=inf;
for(int i=l;i<=r;i++){
int lv,rv;
lv = l>i-1 ? stoi(arr[2*l]) : sol(l,i-1,0);
if(i+1>r) rv = stoi(arr[2*r+2]);
else if(arr[2*i+1]=="+") rv = sol(i+1,r,0);
else rv = sol(i+1,r,1);
if(arr[2*i+1]=="+") ret=min(lv+rv,ret);
else ret=min(lv-rv,ret);
}
}
return ret;
}
int solution(vector<string> _arr)
{
memset(dp,-1,sizeof(dp));
arr=_arr;
return sol(0,arr.size()/2-1,1);
}