蓝桥打卡-day25【玩具、滑雪】

总贴：第十四届蓝桥杯三月真题刷题训练——第 26 天 （3.29）-CSDN社区

题一：B-玩具_牛客小白月赛69 (nowcoder.com)

import java.util.Scanner;
import java.util.Arrays;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        for(int i = 0 ; i < n ; i++){
            a[i] = sc.nextLong();
        }
        Arrays.sort(a);
        long sum = 0;
        for(int i = n-1; i>= 0 ; i-=2){
            sum += a[i];
        }
        System.out.print(sum);
    } 
}

题2、滑雪_牛客题霸_牛客网 (nowcoder.com)

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] a = new int[n][m];
        int[][] dp = new int[n][m];
        for (int i = 0 ; i < n ; i++)
            for (int j = 0 ; j < m ; j++)
                a[i][j] = sc.nextInt();
        int ans = 0 ;
        for (int i = 0 ; i < n ; i++)
            for (int j = 0 ; j < m ; j++)
                ans = Math.max(ans, dfs(a, n, m, i, j, Integer.MAX_VALUE , dp));
        System.out.print(ans);


    }
    static int dfs(int[][] a, int n, int m, int i, int j, int pre, int[][] dp) {
        if (i < 0 || i >= n || j < 0 || j >= m || a[i][j] >= pre) return 0;
        if (dp[i][j] != 0) return dp[i][j];
        dp[i][j] = 1;
        dp[i][j] = Math.max(dp[i][j], dfs(a, n, m, i - 1, j, a[i][j], dp) + 1);
        dp[i][j] = Math.max(dp[i][j], dfs(a, n, m, i + 1, j, a[i][j], dp) + 1);
        dp[i][j] = Math.max(dp[i][j], dfs(a, n, m, i, j - 1, a[i][j], dp) + 1);
        dp[i][j] = Math.max(dp[i][j], dfs(a, n, m, i, j + 1, a[i][j], dp) + 1);
        return dp[i][j];
    }
}