蓝桥杯B组试题组队

    技术2024-10-07  56

    蓝桥杯B组试题组队

    import java.io.File; import java.io.FileNotFoundException; import java.util.Scanner;

    public class Main { static Scanner in = new Scanner(System.in); static int n; static int[][] a = new int[25][10]; static boolean[] vis = new boolean[25]; static int max = Integer.MIN_VALUE;

    public static void main(String[] args) throws FileNotFoundException { Scanner in = new Scanner(new File("src/JavaB/s10/1.txt")); for (int i = 1; i <= 20; ++i) for (int j = 1; j <= 5; ++j) a[i][j] = in.nextInt(); dfs(0, 0); System.out.println(max); } static void dfs(int k, int sum) { if (k == 5) { if (sum > max) max = sum; return; } for (int i = 1; i <= 20; ++i) { if (!vis[i]) { vis[i] = true; dfs(k + 1, sum + a[i][k + 1]); vis[i] = false; } } }
    Processed: 0.012, SQL: 9