1149 RGB거리

#include <stdio.h>
#include <algorithm>
 
using namespace std;
int a[1001][4] = { 0 };
int dp[1001][4] = { 0 };
 
int main() {
    int n;
    scanf("%d", &n);
    getchar();
 
    for (int i = 1; i <= n; i++) {
        scanf("%d %d %d", &a[i][1], &a[i][2], &a[i][3]);
    }
 
    for (int i = 1; i <= n; i++) {
        dp[i][1] = min(dp[i - 1][2], dp[i - 1][3]) + a[i][1];
        dp[i][2] = min(dp[i - 1][1], dp[i - 1][3]) + a[i][2];
        dp[i][3] = min(dp[i - 1][2], dp[i - 1][1]) + a[i][3];
    }
 
    int small = dp[n][1];
    small = min(small, dp[n][2]);
    small = min(small, dp[n][3]);
 
    printf("%d", small);
}