BOJ[백준] - 1126 - 같은탑
https://www.acmicpc.net/problem/1126
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 |
#include <cstdio>
#define MAX(a,b) ((a)>(b) ? (a):(b))
const int inf = 10000000;
int a[50], dp[50][250001], n;
int go(int k, int diff)
{
if(diff > 250000)
return -inf;
if(k == n)
{
if(diff == 0)
return 0;
else
return -inf;
}
if(dp[k][diff] != -1)
return dp[k][diff];
dp[k][diff] = go(k + 1, diff);
dp[k][diff] = MAX(dp[k][diff], go(k + 1, diff + a[k]));
if(a[k] > diff)
dp[k][diff] = MAX(dp[k][diff], diff + go(k + 1, a[k] - diff));
else
dp[k][diff] = MAX(dp[k][diff], a[k] + go(k + 1, diff - a[k]));
return dp[k][diff];
}
int main()
{
scanf("%d", &n);
for(int i = 0; i<n; i++)
scanf("%d", &a[i]);
for(int i = 0; i < 50; i++)
for(int j = 0; j < 250001; j++)
dp[i][j] = -1;
int ans = go(0, 0);
printf("%d", (ans ? ans : -1));
return 0;
} |
cs |
'Algorithm 문제풀이 > BOJ [백준] 문제풀이' 카테고리의 다른 글
BOJ[백준] - 1463 - 1로 만들기 (0) | 2017.07.15 |
---|---|
BOJ[백준] - 1328 - 고층 빌딩 (0) | 2017.07.15 |
BOJ[백준] - 6497 - 전력난 (0) | 2017.07.14 |
BOJ[백준] - 4386 - 별자리 만들기 (0) | 2017.07.14 |
BOJ[백준] - 1922 - 네트워크 연결 (0) | 2017.07.14 |