蓝桥杯算法提高VIP-数组输出 （Java代码）

解题思路:

注意事项:

参考代码:

int[][] a = new int[3][4];

int[][] arr = new int[3][4];

int count = 0;

int[] c = new int[24];

for(int i = 0;i<c.length;i++)

{

c[i] = 999;

}

int w = 0;

int x = 0;

Scanner sb = new Scanner(System.in);

for(int i = 0;i<3;i++)

{

for(int j = 0;j<4;j++)

{

a[i][j] = sb.nextInt();

arr[i][j] = Math.abs(a[i][j]);

}

}

int max = arr[0][0];

for(int i = 0;i<3;i++)

{

for(int j = 0;j<4;j++)

{

if(arr[i][j]>=max)

{

max=arr[i][j];

}

}

}

for(int i = 0;i<3;i++)

{

for(int j = 0;j<4;j++)

{

if(arr[i][j]==max)

{

c[count] = i;

c[count+1] = j;

count+=2;

}

}

}

w = c[0];

x = c[1];

for(int l =2;l<c.length;l+=2)

{

w = Math.min(w,c[l]);

x = Math.min(x, c[l+1]);

}

System.out.println(max+" "+(w+1)+" "+(x+1));