紫书 UVa116

#include<iostream>
#include<string>
#include<cassert>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<set>
#include<sstream>
#include<fstream>
#include<cstdio>
#include<queue>
#include<unordered_map>
#include<tuple>
#include<complex>
#include<memory>
#include<bitset>
using namespace std;
const int INF = std::numeric_limits<int>::max()/2;
int d[20][110];
int next1[20][110];
int a[20][110];
int main()
{
	//freopen("input.txt", "r", stdin);
	int m, n;
	while (scanf("%d", &m)==1)
	{
		scanf("%d", &n);
		memset(next1, -1, sizeof(next1));
		memset(d, 0, sizeof(d));
		for (int i = 0; i < m; ++i)
		{
			for (int j = 0; j < n; ++j)
				scanf("%d", &a[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)d[i][j] = a[i][j];
				else
				{
					int rows[3] = { i,i - 1,i + 1 };
					if (i == 0)rows[1] = m - 1;
					if (i == m - 1)rows[2] = 0;
					sort(rows, rows + 3);
					d[i][j] = INF;
					for (int k = 0; k < 3; ++k)
					{
						int v = d[rows[k]][j + 1] + a[i][j];
						if (v < d[i][j]) {
							d[i][j] = v;
							next1[i][j] = rows[k];
						}
					}
					
				}
				if (j == 0 && d[i][j] < ans) {
					ans = d[i][j];
					first = i;
				}
			}
		}
		printf("%d", first + 1);
		for (int i = next1[first][0], j = 1; j < n; i = next1[i][j], j++)
		{
			printf(" %d", i + 1);
		}
		printf("\n%d\n", ans);
	}
}