继续颓废中…….
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<queue>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int M=1e2+10,N=1e2+10;
int f[M][N],next[M][N],m,n;
int a[M][N];
void solve(){
const int inf=0x3f3f3f;
int ans=inf;
int fir=0;
for(int j=n;j>=1;j--){
fo(i,1,m){
if(j==n) f[i][j]=a[i][j];
else
{
int row[3]={i,i+1,i-1};
if(i==1) row[2]=m;
if(i==m) row[1]=1;
sort(row,row+3);
f[i][j]=inf;
for(int k=0;k<3;k++){
int id=f[row[k]][j+1]+a[i][j];
if(f[i][j]>id) f[i][j]=id,next[i][j]=row[k];
}
}
if(j==1&&f[i][j]<ans) ans=f[i][j],fir=i;
}
}
printf("%d",fir);
for(int i=next[fir][1],j=1;j<=n;i=next[i][j],j++){
if(j==2) continue;
printf(" %d",i);
}
printf("\n%d\n",ans);
return ;
}
int main(){
while(scanf("%d%d",&m,&n))
{
fo(i,1,m)
fo(j,1,n) scanf("%d",&a[i][j]);
solve();
}
return 0;
}