백준 1149번 : RGB 거리

문제 링크 : www.acmicpc.net/problem/1149

내 풀이(2021.1.28.) :

#include <iostream>
#include <algorithm>

using namespace std;

int dp[1001][3];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N; cin >> N;
	int a, b, c; cin >> a >> b >> c;
	dp[1][0] = a;
	dp[1][1] = b;
	dp[1][2] = c;
	for (int i = 2; i <= N; i++) {
		int a, b, c; cin >> a >> b >> c;
		dp[i][0] = min(dp[i - 1][1], dp[i - 1][2]) + a;
		dp[i][1] = min(dp[i - 1][2], dp[i - 1][0]) + b;
		dp[i][2] = min(dp[i - 1][0], dp[i - 1][1]) + c;
	}

	int ans = min(dp[N][0], dp[N][1]);
	ans = min(dp[N][2], ans);
	cout << ans;

	return 0;
}