题目详情:
上代码:我是一次就AC的,没有报错
Java代码如下:100分!!!
package CSP;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//键盘录入n和m,0<=n<=1000;0<=m<=10; 1005和15
int n = sc.nextInt();
int m = sc.nextInt();
int[][] array = new int[1005][15];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
array[i][j] = sc.nextInt();
}
}
int[] count = new int[1005];
int[] index = new int[1005];
//n个仓库
for (int i = 0; i < n; i++) {
//每个仓库比较 n-1 轮
int number = 0;
for (int j = 0; j < n; j++) {
//记录第j个仓库是否是第i个仓库的上级仓库
boolean flag = true;
//用index[j]记录这是第i个仓库的第几个上级仓库
if (i != j) {
for (int k = 0; k < m; k++) {
if (array[j][k] <= array[i][k]) {
flag = false;
}
}
} else {
continue;
}
if (flag) {
if (index[i] == 0) {
number = j + 1;
index[i]++;
} else {
if (number >= j + 1) {
number = j + 1;
index[i]++;
}
}
}
}
// 打表记录状态:
// System.out.println("index[" + i + "]=" + index[i]);
count[i] = number;
}
for (int i = 0; i < n; i++) {
System.out.println(count[i]);
}
}
}