import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNext()) { int n = scanner.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = scanner.nextInt(); } int max = Integer.MIN_VALUE; int index = -1; for (int i = 0; i < n; i++) { if (max < arr[i]) { max = arr[i]; index = i; } } System.out.println(max + " " + index); } } }
[ALGO-49] 寻找数组中最大值,布布扣,bubuko.com
原文:http://blog.csdn.net/u011506951/article/details/27109443