第十届蓝桥杯省赛JavaC组真题——详细答案对照(完整版-包含打扫机器人的视频全过程讲解与编码内容对照)-2

package action;
import java.util.Scanner;
public class demo {
  public static void main(String[] args) {
  Scanner sc = new Scanner(System.in);
  int n = sc.nextInt();
  int m = sc.nextInt();
  int [][] arr = new int[n+1][m+1];
  for (int i = 1; i < arr.length; i++) {
    for (int j = 1; j < arr[i].length; j++) {
    arr[i][j] = sc.nextInt();
    }
  }
  int [][] brr = new int[m+1][n+1];
  // 转换
  for (int i = 1; i < brr.length; i++) {
    for (int j = 1; j < brr[i].length; j++) {
    brr[i][j] = arr[n-j+1][i]; 
    }
  }
  // 打印
  for (int i = 1; i < brr.length; i++) {
    for (int j = 1; j < brr[i].length; j++) {
    System.out.print(brr[i][j]+" ");
    }
    System.out.println();
  }
  }
}

package action;
import java.util.Scanner;
public class demo {
  public static void main(String[] args) {
  Scanner sc = new Scanner(System.in);
  int n = sc.nextInt();
  int m = sc.nextInt();
  int t = sc.nextInt();
  int[][] arr = new int[n + 1][t + 1];
  for (int i = 0; i < m; i++) {
    int t1 = sc.nextInt(); // 时刻
    int n1 = sc.nextInt(); // 几店
    arr[n1][t1]++; // n店t时刻的订单数
  }
  int count = 0; // 优先缓存个数
  // 对每家店进行计算
  for (int i = 1; i <= n; i++) {
    int num = 0; // 缓存值
    boolean f = false; // 判断是否是优先缓存
    for (int j = 1; j <= t; j++) {
    if (arr[i][j] == 0) { // 没有订单时
      if (num <= 0) {
      num = 0;
      } else {
      num--;
      }
    } else {
      num += 2 * arr[i][j]; // 有订单时：缓存值是每个订加2
    }
    if (num > 5) {
      f = true;
    }
    if (num <= 3) {
      f = false;
    }
    }
    if (f) {
    count++;
    }
  }
  System.out.println(count);
  }
}

package action;
import java.util.Scanner;
public class demo {
  public static void main(String[] args) {
  Scanner sc = new Scanner(System.in);
  int K = sc.nextInt();
  sc.nextLine();
  String str = sc.nextLine();
  int count = 0;
  for (int i = 0; i < str.length() - 8; i++) {
    if (str.charAt(i) == 'A') {
    String alicestr = str.substring(i, i + 5);
    if (alicestr.equals("Alice")) {
      for (int j = 0; j < K - 3; j++) {
      if (str.charAt(i + j) == 'B') {
        String bobstr = str.substring(i + j, i + j + 3);
        if (bobstr.equals("Bob")) {
        count++;
        }
      }
      }
    }
    }
    if (str.charAt(i) == 'B') {
    String bobstr = str.substring(i, i + 3);
    System.out.println(bobstr);
    if (bobstr.equals("Bob")) {
      for (int j = 0; j < K - 5; j++) {
      if (str.charAt(i + j) == 'A') {
        String alicestr = str.substring(i + j, i + j + 5);
        System.out.println(alicestr);
        if (alicestr.equals("Alice")) {
        count++;
        }
      }
      }
    }
    }
  }
  System.out.println(count);
  }
}

package action;
import java.util.Arrays;
import java.util.Scanner;
public class demo {
  public static void main(String[] args) {
  Scanner sc = new Scanner(System.in);
  int n = sc.nextInt();
  int[] arr = new int[n];
  for (int i = 0; i < arr.length; i++) {
    arr[i] = sc.nextInt();
  }
  Arrays.sort(arr);
  // 获取最小差值
  int min = arr[arr.length - 1];
  for (int i = 1; i < arr.length; i++) {
    if ((arr[i] - arr[0]) < min) {
    min = (arr[i] - arr[0]);
    }
  }
  System.out.println((arr[arr.length - 1] - arr[0]) / min + 1);
  }
}

package action;
import java.util.Arrays;
import java.util.Scanner;
public class demo {
  static int N,K;
  static int arr[];//存储机器人坐标
  public static void main(String[] args) {
  Scanner sc=new Scanner(System.in);
  N=sc.nextInt();
  K=sc.nextInt();
  arr=new int[K];
  for (int i = 0; i < K; i++) {
    arr[i]=sc.nextInt();
  }
  //输入流没用了
  sc.close();
  Arrays.sort(arr);//自然排序
  int l=0,r=N,mid=0;
  while (l <= r) {
    //相当于二分查找
    mid=(r+l)>>>1;
    if(check(mid)) {
    r = mid-1;
    }else l = mid+1; 
  }
  System.out.println((mid-1)*2);
  }
  private static boolean check(int m) {
  int sum=0;//记录扫描区域
  for (int i = 0; i < K; i++) {//遍历每个机器人
    if(arr[i]-m<=sum) {
    if(arr[i]<=sum) {
      sum=arr[i]+m-1;
    }else sum+=m;
    }else return false;
  }
  return sum >= N;
  }
}

10 3
5 2 10