백준 1149 RGB거리 C++

 

#include<bits/stdc++.h>
#define MAX 1002
using namespace std;
int N;
int dp[MAX][3], cost[MAX][3];

void solution(){
    for(int i = 1; i <= N; i++){
        dp[i][0] = min(dp[i-1][1] + cost[i][0], dp[i-1][2] + cost[i][0]);
        dp[i][1] = min(dp[i-1][0] + cost[i][1], dp[i-1][2] + cost[i][1]);
        dp[i][2] = min(dp[i-1][0] + cost[i][2], dp[i-1][1] + cost[i][2]);
    }
    cout << min(min(dp[N][0], dp[N][1]), dp[N][2]);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> N;
    for(int i = 1; i <= N; i++){
        for(int j = 0; j < 3; j++)
            cin >> cost[i][j];
    }
    solution();
}