海选女主角

第一种方法所消耗的时间较多

java代码

    

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 mark1 = 0;
            int mark2 = 0;
            int arr[][] = new int[n + 1][m + 1];
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    arr[i][j] = sc.nextInt();
                }
            }
            int max = arr[0][0];
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    if (Math.abs(max) < Math.abs(arr[i][j])) {
                        max = arr[i][j];
                        mark1 = i;
                        mark2 = j;
                    }
                }
            }
            System.out.println(mark1 + " " + mark2 + " " + max);
        }
    }
}

java描述：第二种方法耗时间较少

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 x = 1;
            int y = 1;
            int[][] arr = new int[n + 1][m + 1];
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    arr[i][j] = sc.nextInt();
                    if (Math.abs(arr[x][y]) < Math.abs(arr[i][j])) {
                        x = i;
                        y = j;
                    }
                }
            }
            int temp = arr[x][y];
            System.out.println(x + " " + y + " " + temp);
        }

    }
}

C语言描写第一种方法

#include<stdio.h>
#include<math.h>
int main() {
	int i,j,n,m,max,mark1,mark2;
	int arr[50][50];
	while( scanf("%d%d",&n,&m)) {

		for(i=1; i<=n; i++) {
			for(j=1; j<=m; j++) {
				scanf("%d",&arr[i][j]);
			}
		}


		max=arr[0][0];
		for(i=1; i<=n; i++) {
			for(j=1; j<=m; j++) {
				if(abs(arr[i][j])>abs(max)) {
					max=arr[i][j];
					mark1=i;
					mark2=j;
				}
			}
		}
		printf("%d %d %d\n",mark1,mark2,max);
	}

}

C语言描述第二种方法

#include<stdio.h>
#include<math.h>
int main() {
	int m,n,i,j,x,y,s,a[100][100];
	while(scanf("%d%d",&m,&n)!=EOF) {
		x=1;
		y=1;
		for(i=1; i<=m; i++) {
			for(j=1; j<=n; j++) {
				scanf("%d",&a[i][j]);
				if(fabs(a[x][y])<fabs(a[i][j])) {
					x=i;
					y=j;
				}
			}
		}
		s=a[x][y];
		printf("%d %d %d\n",x,y,s);
	}
}