KiKi想从n行m列的方阵队列中找到身高最高的人的位置,请你帮助他完成这个任务。
KiKi想从n行m列的方阵队列中找到身高最高的人的位置,请你帮助他完成这个任务。
第一行包含两个整数n和m,表示这个方阵队列包含n行m列。从2到n+1行,每行输入m个整数(范围-231~231-1),用空格分隔,共输入n*m个数,表示方阵中的所有人的身高(保证输入身高都不相同)。(1≤x≤n≤10,1≤y≤m≤10)
一行,输出两个整数,用空格分隔,表示方阵中身高最高的人所在的行号和列号。
2 2 175 180 176 185
2 2
import java.util.Scanner; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(), m = in.nextInt(); int[][] nums = new int[n][m]; int max = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { nums[i][j] = in.nextInt(); if (max < nums[i][j]){ //找出最大值 max = nums[i][j]; } } } for (int i = 0; i < n; i++) { // 打印最大值的位置 for (int j = 0; j < m; j++) { if (max == nums[i][j]){ System.out.print((i+1) + " " + (j+1)); break; } } } } }
import java.util.Scanner; public class Main{ public static void main(String[] args){ Scanner sc=new Scanner(System.in); int n=sc.nextInt(),m=sc.nextInt(); int[][] arr=new int[n][m]; int max=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ int num=sc.nextInt(); if(num>max) max=num; arr[i][j]=num; } } int row=0,col=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(arr[i][j]==max){ row=i; col=j; } } } System.out.printf("%d %d",++row,++col); } }
import java.util.*; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while(scanner.hasNext()){ int n = scanner.nextInt(); int m = scanner.nextInt(); int[][] num = new int[n][m]; int maxHeightRow = 0; int maxHeightColumn = 0; int maxHeight = 0; for(int i = 0 ; i < n;i++){ for(int j = 0;j < m;j++){ num[i][j] = scanner.nextInt(); if(num[i][j] > maxHeight){ maxHeight = num[i][j]; maxHeightRow = i + 1; maxHeightColumn = j + 1; } } } System.out.print(maxHeightRow + " " + maxHeightColumn); } } }
import java.io.*; public class Main{ public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] s = br.readLine().split(" "); int n = Integer.parseInt(s[0]); int m = Integer.parseInt(s[1]); int heightMax = 0; int line = 0; int column = 0; for (int i = 0; i < n; i++) { String[] str = br.readLine().split(" "); for (int j = 0; j < m; j++) { int height = Integer.parseInt(str[j]); if (height > heightMax){ heightMax = height; line = i+1; column = j+1; } } } System.out.println(line+" "+column); } }
import java.util.Scanner; public class Main{ public static void main(String[] args){ Scanner sc=new Scanner(System.in); while(sc.hasNext()){ int n=sc.nextInt(); int m=sc.nextInt(); int data[][]=new int[n][m]; int row=0,column=0,maxhigh=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ data[i][j]=sc.nextInt(); if(data[i][j]>maxhigh){ maxhigh=data[i][j]; row=i+1; column=j+1; } } } System.out.print(row+" "+column); } } }
import java.math.BigDecimal; import java.math.BigInteger; import java.util.HashSet; import java.util.Locale; import java.util.Random; import java.util.Scanner; public class Main{ public static void main(String [] args){ Scanner sc = new Scanner(System.in); while (sc.hasNext()){ int m =sc.nextInt(); int n= sc.nextInt(); int s[][] = new int[m][n]; for(int i =0;i<m;i++){ for(int j= 0;j<n;j++){ s[i][j] = sc.nextInt(); } } int index1=0,index2=0; for(int i=0;i<m;i++) { for(int j=0;j<n;j++){ if(s[i][j] >s[index1][index2]){ index1=i; index2=j; } } } System.out.println((++index1)+" "+(++index2)); } } }
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int[][] arr = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { arr[i][j] = sc.nextInt(); } } int nn = 0; int mm = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (arr[nn][mm] < arr[i][j]) { nn = i; mm = j; } } } nn += 1; mm += 1; System.out.println(nn + " " + mm); } }