例题9-4(uva-116)

#include <iostream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>

#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int dp[10][100];
int arr[10][100];
int dirct[10][100];

const int INF = 1e9 + 7;

int main()
{
	int m, n,a,v;
	while (cin >> m >> n) {
		for (int i = 0; i < m; ++i) {
			for (int j = 0; j < n; ++j)
				cin >> arr[i][j];
		}

		int ans = INF, first = 0;
		
		for (int j = n - 1; j >= 0; --j) {
			for (int i = 0; i < m; ++i) {
				if (j == n - 1) {
					dp[i][j] = arr[i][j];
				}
				else {
					int rows[] = { i,i - 1,i + 1 };

					if (i - 1 < 0) rows[1] = m - 1;
					if (i + 1 > m - 1) rows[2] = 0;

					sort(rows, rows + 3);
					dp[i][j] = INF;

					for (int k = 0; k < 3; ++k) {
						v = dp[rows[k]][j + 1] + arr[i][j];
						if (v < dp[i][j]) {
							dp[i][j] = v;
							dirct[i][j] = rows[k];
						}
					}
				}
				
				if (j == 0 && dp[i][j] < ans) { ans = dp[i][j]; first = i; }
			}
		}
		cout << first + 1;
		for (int i = dirct[first][0], j = 1; j < n; i = dirct[i][j], j++) {
			cout << " " << i + 1;
		}
		cout << endl << ans << endl;
	}
	return 0;
}