题意:给定一个n*m的矩阵,要求从第一列的任何一行出发,每次沿右或右下或右上到达后面一列,最后到第m列任何一行整个路程的最小值,并且要求是字典序最小的。、
分析:正推不好做,选择逆推,同时记录路径
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#define FRER() freopen("in.txt","r",stdin)
#define FREW() freopen("out.txt","w",stdout)
#define go int T;cin>>T;while(T--)
#define debug cout<<"****************"<<endl
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int maxn = 100 + 7,inf = 0x3f3f3f3f;
int n,m;
int a[maxn][maxn];
int dp[maxn][maxn];
int Next[maxn][maxn];
int main(){
//FRER();
//FREW();
while(scanf("%d%d",&m,&n)!=EOF){
int ans=inf,first=0;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
memset(dp, 0, sizeof(dp));
for(int j=n;j>=1;j--){
for(int i=1;i<=m;i++){
if(j==n) dp[i][j] = a[i][j];
else{
int rows[3]={i,i-1,i+1};
if(i==1) rows[1] = m;
if(i==m) rows[2] = 1;
sort(rows, rows+3);
dp[i][j] = inf;
for(int k=0;k<3;k++){
int v = dp[rows[k]][j+1] + a[i][j];
if(v<dp[i][j]){
dp[i][j] = v;
Next[i][j] = rows[k];
}
}
}
if(j==1&&dp[i][j]<ans){ans=dp[i][j];first=i;}
}
}
printf("%d",first);
for(int i=Next[first][1],j=2;j<=n;i=Next[i][j],j++){
printf(" %d",i);
}
printf("\n%d\n",ans);
}
return 0;
return 0;
}