forked from b-chae/AlgorithmStudy
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1932.cpp
More file actions
54 lines (43 loc) · 785 Bytes
/
Copy path1932.cpp
File metadata and controls
54 lines (43 loc) · 785 Bytes
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
#include <iostream>
#include <algorithm>
using namespace std;
int N;
int** C;
int** D;
int main()
{
int i, j;
cin >> N;
C = (int**)malloc(sizeof(int*) * N);
D = (int**)malloc(sizeof(int*) * N);
for (i = 0; i < N; i++) {
C[i] = (int*)malloc(sizeof(int) * N);
D[i] = (int*)malloc(sizeof(int) * N);
}
for (i = 0; i < N; i++) {
for (j = 0; j <= i; j++) {
cin >> C[i][j];
}
}
D[0][0] = C[0][0];
for (i = 1; i < N; i++) {
for (j = 0; j <= i; j++) {
int tmp1 = -1, tmp2 = -1;
if (j != 0) {
tmp1 = D[i - 1][j - 1] + C[i][j];
}
if (j != i) {
tmp2 = D[i - 1][j] + C[i][j];
}
if (tmp1 > tmp2) {
D[i][j] = tmp1;
}
else {
D[i][j] = tmp2;
}
}
}
sort(&D[N - 1][0], &D[N - 1][N]);
cout << D[N - 1][N - 1];
return 0;
}