hihoCoder 1051 补提交卡 最详细的解题报告

题目来源：补提交卡

解题思路：假设未提交程序的天数为：a1,a2,....,an，补交的张数为M。依次从a1,a2,....,an中去掉连续的 K 天（0<=K<=M），然后再来计算剩余数组中最长连续提交天数。

具体算法（Java版，直接AC）

 import java.util.Scanner;

 public class Main {

     //计算数组中最长连续提交天数
     public static int getMax(int[] array) {
         int[] copy = new int[array.length + 2];
         copy[0] = 0;
         copy[array.length + 1] = 101;
         for (int i = 0; i < array.length; i++) {
             copy[i + 1] = array[i];
         }
         int max = Integer.MIN_VALUE;
         for (int i = 1; i < copy.length; i++) {
             int sum = copy[i] - copy[i - 1] - 1;
             max = max > sum ? max : sum;
         }
         return max;
     }

     //从下标为start开始，删除长度为count个元素
     public static int[] remove(int[] array, int count, int start) {
         int[] copy = new int[array.length - count];
         int index = 0;
         for (int i = 0; i < start; i++) {
             copy[index++] = array[i];
         }
         for (int i = start + count; i < array.length; i++) {
             copy[index++] = array[i];
         }
         return copy;
     }

     //计算使用k张补交卡后，最长连续提交天数
     public static int solve(int[] array, int k) {
         int max = Integer.MIN_VALUE;
         for (int i = 0; i <= array.length - k; i++) {
             int sum = getMax(remove(array, k, i));
             max = max > sum ? max : sum;
         }
         return max;
     }

     public static void main(String[] args) {
         Scanner scanner = new Scanner(System.in);
         int T = scanner.nextInt();
         while (T > 0) {
             int N = scanner.nextInt();
             int M = scanner.nextInt();
             int[] array = new int[N];
             for (int i = 0; i < N; i++) {
                 array[i] = scanner.nextInt();
             }
             int max = Integer.MIN_VALUE;
             for (int i = 0; i <= M; i++) {
                 int sum = solve(array, i);
                 max = sum > max ? sum : max;
             }
             System.out.println(max);
             --T;
         }
     }
 }