uva116(DP)

题目的意思就是从第一列开始,走到最后一列,权值最小是多少.

可以走三种方式,,第一行在往上是最后一行(见图).

最优子结构就是 d[ i ] [ j ] =min  ( d[ ｋ][ j ]  -  g[ i ][ j ] )　　其中ｋ是第ｊ列往后走一列　，行数的三种变换．

从第 i　行第　ｊ　列　的点走到最后一行最小值 　,　等于第 ｋ　行　第　j + 1列走到最后一列的最小值　加上（ｉ，ｊ）这个点的值.

因为要求长度一样按字典序，所以我们只能从前往后ｄｐ．

AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define ll long long
using namespace std;
const int M = 15;
const int N = 105;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll g[M][N];
ll d[M][N];
int r,c;
ll min(ll a ,ll b ,ll c) {
	ll temp = (a < b ? a : b);
	ll temp2 = (temp < c ? temp : c);
	return temp2;
}
ll dp(int l ,int t) {
	if(d[l][t] != inf) 
		return d[l][t];
	int up,down;
	int ahead = l;
	if(l == 0)
		up = r - 1;
	else
		up = l - 1;
	if(l == r - 1)
		down = 0;
	else
		down = l + 1;
	ll m = min(dp(up , t + 1) , dp(down ,t + 1) ,dp(ahead , t + 1));
	d[l][t] = m + g[l][t];
	return d[l][t];
}
void print(int l , int t) {
	if(t == c - 1) {
		printf("%d",l + 1);
		return;
	}
	printf("%d " ,l + 1);
	int up,down;
	int ahead = l;
	if(l == 0)
		up = r - 1;
	else
		up = l - 1;
	if(l == r - 1)
		down = 0;
	else
		down = l + 1;
	int temp[3] = {up ,ahead , down};
	sort(temp ,temp + 3);
	for (int i = 0 ; i < 3 ;i++) {
		if(d[l][t] - g[l][t] == d[temp[i]][t + 1]) {
			print(temp[i] , t + 1);
			break;
		}	
	}
}
int main () {
	while (~scanf("%d%d",&r,&c)) {
		for (int i = 0 ; i < M ;i++) {
			for (int j = 0 ; j < N ;j++)
				d[i][j] = inf;
		}
		memset(g, 0 , sizeof(g));
		for (int i = 0 ; i < r ;i++) {
			for (int j = 0 ; j < c; j++) {
				scanf("%lld",&g[i][j]);
			}
		}
		for (int i = 0 ; i < r; i++) {
			d[i][c -1] = g[i][c - 1];
		}
		ll m = inf;
		int res;
		for (int i = 0 ; i < r ;i++) {
			d[i][0] = dp(i , 0);
			if(d[i][0] < m){
				m = d[i][0];
				res = i;
			}
		}
		print(res , 0);
		printf("\n");
		printf("%lld\n",m);
	}
}