Travelling Salesman Problem

Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 829    Accepted Submission(s): 182

Special Judge

Problem Description

Teacher Mai is in a maze with 

n rows and m columns. There is a non-negative number in each cell. Teacher Mai wants to walk from the top left corner (1,1) to the bottom right corner (n,m). He can choose one direction and walk to this adjacent cell. However, he can't go out of the maze, and he can't visit a cell more than once.

Teacher Mai wants to maximize the sum of numbers in his path. And you need to print this path.

 

 

Input

There are multiple test cases.

For each test case, the first line contains two numbers 

n,m(1≤n,m≤100,n∗m≥2).

In following n lines, each line contains m numbers. The j-th number in the i-th line means the number in the cell (i,j). Every number in the cell is not more than 104.

 

 

Output

For each test case, in the first line, you should print the maximum sum.

In the next line you should print a string consisting of "L","R","U" and "D", which represents the path you find. If you are in the cell 

(x,y), "L" means you walk to cell (x,y−1), "R" means you walk to cell (x,y+1), "U" means you walk to cell (x−1,y), "D" means you walk to cell (x+1,y).

 

 

Sample Input

3 3 2 3 3 3 3 3 3 3 2

 

 

Sample Output

25 RRDLLDRR

1 #include 
       
          2 #include 
        
           3 int main()  4 {  5     int n,m;  6     int a[106][106],s,x,y;  7     int i,j,k;  8     while(scanf("%d %d",&n,&m)!=EOF)  9     { 10         s=0; 11         int mi; 12         for(i=1;i<=n;i++) 13         { 14             for(j=1;j<=m;j++) 15             { 16                 scanf("%d",&a[i][j]); 17                 s=s+a[i][j]; 18             } 19         } 20         if(n%2==1) 21         { 22             printf("%d\n",s); 23             for(i=1;i<=n;i++) 24             { 25                 if(i%2==1) 26                 { 27                     for(j=1;j