CCF-CSP真题《202312-1 仓库规划》思路+python，c++，java满分题解_西西艾弗岛上共有 个仓库,依次编号为 。每个仓库均有一个 维向量的位置编码,用来

想查看其他题的真题及题解的同学可以前往查看：CCF-CSP真题附题解大全

真题来源：仓库规划

 感兴趣的同学可以如此编码进去进行练习提交

python题解： 

n, m = map(int, input().split())
warehouse = [list(map(int, input().split())) for _ in range(n)]
for i in range(n):
    output = 0
    for j in range(n):
        if i!=j:
            flag = True
            for k in range(m):
                if warehouse[i][k]>=warehouse[j][k]:
                    flag = False
                    break
            if flag:
                output = j+1
                break
    print(output)

运行结果：

c++满分题解：

#include <iostream>
#include <vector>
using namespace std;
 
int main() {
    int N = 0, M = 0;
    cin >> N >> M;
    vector<vector<int> > warehouse(N + 1, vector<int>(M));
    for (int i = 1; i <= N; i++) {
        for (int j = 0; j < M; j++) {
            cin >> warehouse[i][j];
        }
    }
    for (int i = 1; i <= N; i++) {
        int res = 0;
        for (int j = 1; j <= N; j++) {
            if (i != j) {
                bool flag = true;
                for (int k = 0; k < M; k++) {
                    if (warehouse[i][k]>=warehouse[j][k]) {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    res = j;
                    break;
                }
            }
        }
        cout << res << endl;
    }
    return 0;
}

运行结果：

Java满分题解：

import java.util.Scanner;
 
class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int m = input.nextInt();
        int[][] warehouse = new int[n][m];
        for (int i = 0;i < n;i++) {
            for (int j = 0;j < m;j++) {
                warehouse[i][j] = input.nextInt();
            }
        }
        for (int i = 0;i < n;i++) {
            int output = 0;
            for (int j = n - 1;j >= 0;j--) {
                boolean flag = true;
                for (int k = 0;k < m;k++) {
                    if (warehouse[j][k] <= warehouse[i][k]) {
                        flag = false;
                        break;
                    }
                }
                if (flag) {
                    output = j + 1;
                }
            }
            System.out.println(output);
        }
    }
 
}

运行结果：