algorithm/rgb_distance.cpp at master · wooyongha/algorithm · GitHub

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
#include <iostream>

using namespace std;

int color_table[3][1001];
int color[3][1001];

int min(int a, int b){
    return a < b ? a:b;
}

int min_cost(int a, int b, int c){
    int min;

    if(a > b){
        min = b;
    } else {
        min = a;
    }

    return c > min ? min : c;
}

int main(void){
    int i, n;

    cin >> n;

    for(i = 1; i <= n; i++){
        cin >> color_table[0][i];
        cin >> color_table[1][i];
        cin >> color_table[2][i];
    }

    color[0][0] = color[1][0] = color[2][0] = 0;
    color_table[0][0] = color_table[1][0] = color_table[2][0] = 0;

    for(i = 1; i <= n; i++){
        color[0][i] = min(color[1][i-1], color[2][i-1]) + color_table[0][i];
        color[1][i] = min(color[0][i-1], color[2][i-1]) + color_table[1][i];
        color[2][i] = min(color[0][i-1], color[1][i-1]) + color_table[2][i];
    }

    cout << min_cost(color[0][n], color[1][n], color[2][n]) << endl;

    return 0;
}