fork(2) download
copy 
  1.  
  2. //import static java.lang.Integer.parseInt;
  3. 			import java.util.*;
  4. 			import java.io.*;
  5. 			class BYTESM2
  6. 			{
  7. 				public static void main(String args[])
  8. 				throws IOException
  9. 				{
  10. 					int arr[][]=new int[111][111];
  11. 					BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  12. 					//PrintWriter pw=new PrintWriter(System.out);
  13. 					int t=Integer.parseInt(br.readLine().trim());
  14. 					int r,c;
  15. 					while(t--!=0)
  16. 					{
  17. 						//refresing the array
  18. 						for(int[] row: arr)
  19. 							Arrays.fill(row,0);
  20. 						//
  21.  
  22. 						String in[]=br.readLine().trim().split(" ");
  23. 						r=Integer.parseInt(in[0]);
  24. 						c=Integer.parseInt(in[1]);
  25. 						//arr=new int[r][c+2];
  26.  
  27. 						for(int i=0;i<r;i++)
  28. 						{
  29. 							String str=br.readLine().trim();
  30. 							int pointer=1;
  31. 							for(String s: str.split(" "))
  32. 							{
  33. 								//System.out.println("hamba "+s);
  34. 								arr[i][pointer++]=Integer.parseInt(s);
  35. 							}
  36. 							//System.out.println("pointer "+pointer);
  37. 							arr[i][0] = arr[i][pointer] = -1;
  38. 						}
  39. 						//calculation part
  40. 						int big=0;
  41. 						// if just one row is present
  42. 						/*if(r==1)
  43. 						{
  44. 							for(int j=0;j<c;j++)
  45. 							{
  46. 								if(arr[0][j]>big)
  47. 									big=arr[0][j];
  48. 							}
  49. 							System.out.println(big);
  50. 							continue;
  51. 						}
  52. 						else if(c==1)// if just one column is present
  53. 						{
  54. 							for(int i=0;i<r;i++)
  55. 								big+=arr[i][0];
  56. 							System.out.println(big);
  57. 							continue;
  58. 						}
  59. 						else if(r==1 && c==1)
  60. 						{
  61. 							System.out.println(arr[0][0]);
  62. 							continue;
  63.  
  64. 						}*/
  65.  
  66.  
  67.  
  68. 							for(int i=1;i<r;i++)
  69. 							{
  70. 								for(int j=1;j<=c;j++)
  71. 								{
  72. 									/*if(j==0)
  73. 										arr[i][j]+=Math.max(arr[i+1][j],arr[i+1][j+1]);
  74. 									else if(j==c-1)
  75. 										arr[i][j]+=Math.max(arr[i+1][j],arr[i+1][j-1]);*/
  76. 									//else
  77. 									//{
  78. 										int max1=Math.max(arr[i-1][j-1], arr[i-1][j]);
  79. 										int max=Math.max(max1,arr[i-1][j+1]);
  80. 										arr[i][j]+=max;
  81. 									//}
  82.  
  83. 									//if(arr[i][j]>big)
  84. 										//big=arr[i][j];
  85. 								}
  86. 							}
  87. 							for(int j = 1; j <= c; j++)
  88. 				                big = Math.max(big, arr[r-1][j]);
  89. 							// print big
  90. 							System.out.println(big);
  91.  
  92.  
  93. 					}
  94.  
  95.  
  96. 				}
  97. 			}
Success #stdin #stdout 0.06s 380224KB
comments (?)
stdin
copy 
3
6 5
3 1 7 4 2
2 1 3 1 1
1 2 2 1 8
2 2 1 5 3
2 1 4 4 4
5 2 7 5 1
1 5
2 5 3 6 9
5 1
2
3
4
5
6
stdout
copy 
32
9
20
https://ideone.com/kkpViB
language:
Java (12.0.1)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!