UVa 116 - Unidirectional TSP

#include "iostream"using namespace std;int m,n;int matrix[11][101];int path[11][101][2];void minpath(int r,int c){int row=(r-1+m)%m;int length=path[row][c][1];if(path[r][c][1]<path[row][c][1]){length=path[r][c][1];row=r;}else if(path[row][c][1]==path[r][c][1]){if(row>r)row=r;}else{}if(path[((r+1)%m)][c][1]<length){length=path[((r+1)%m)][c][1];row=(r+1)%m;}else if(path[((r+1)%m)][c][1]==length){if(((r+1)%m)<row)row=(r+1)%m;}else{}path[r][c-1][1]=length+matrix[r][c-1];path[r][c-1][0]=row;}int main(){while(cin>>m>>n){for(int i=0;i<m;i++)for(int j=0;j<n;j++)cin>>matrix[i][j];for(int i=0;i<m;i++){path[i][n-1][0]=i;path[i][n-1][1]=matrix[i][n-1];}for(int i=n-2;i>=0;i--)for(int j=0;j<m;j++)minpath(j,i+1);int Min=path[0][0][1];int row=0;for(int i=1;i<m;i++){if(path[i][0][1]<Min){Min=path[i][0][1];row=i;}}cout<<row+1;for(int i=0;i<n-1;i++){cout<<" "<<path[row][i][0]+1;row=path[row][i][0];}cout<<endl<<Min<<endl;}return 0;}