8000 Create 1149.cpp · rinrin528/basic-algo-lecture@aea929b · GitHub
[go: up one dir, main page]

Skip to content

Commit aea929b

Browse files
Create 1149.cpp
1 parent 20c8d31 commit aea929b

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed

0x10/1149.cpp

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
// http://boj.kr/8f068222731440b58498bb7e2b2234c9
2+
#include <bits/stdc++.h>
3+
using namespace std;
4+
5+
int d[1005][3];
6+
int r[1005], g[1005], b[1005];
7+
8+
int main(void){
9+
ios::sync_with_stdio(0);
10+
cin.tie(0);
11+
int n;
12+
cin >> n;
13+
for(int i = 1; i <= n; i++) cin >> r[i] >> g[i] >> b[i];
14+
d[1][0] = r[1];
15+
d[1][1] = g[1];
16+
d[1][2] = b[1];
17+
for(int i = 2; i <= n; i++){
18+
d[i][0] = min(d[i-1][1],d[i-1][2])+r[i];
19+
d[i][1] = min(d[i-1][0],d[i-1][2])+g[i];
20+
d[i][2] = min(d[i-1][0],d[i-1][1])+b[i];
21+
}
22+
cout << *min_element(d[n], d[n]+3);
23+
// cout << min({d[n][0], d[n][1], d[n][2]}); 도 가능
24+
}

0 commit comments

Comments
 (0)
0