题解 | 火星探测器稳定性分析

import java.util.Scanner;
import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        int N = in.nextInt();
        in.nextLine();
        String str = in.nextLine();
        String[] strs = str.split(" ");
        int[] indexs = new int[N];
        for(int i = 0; i < N; i++) {
            indexs[i] = Integer.parseInt(strs[i]);
        }
        int count = 0;
        int maxCount = 0;
        int currentMax = -1;
        int currentMin = 31;
        int begin = 0;
        int end = 0;
        List<int[]> res = new ArrayList<>();
        for(int i = 0; i < N; i++) {
            if(indexs[i] >= 18 && indexs[i] <= 24) {
                currentMax = Math.max(currentMax, indexs[i]);
                currentMin = Math.min(currentMin, indexs[i]);
                if(currentMax - currentMin <= 4) {
                    count++;
                    end = i;
                    if(count > maxCount) {
                        maxCount = count;
                        res.clear();
                    }
                } else {
                    if(count == maxCount) {
                        res.add(new int[]{begin, end});
                    }
                    count = 0;
                    currentMax = -1;
                    currentMin = 31;
                    begin = begin + 1;
                    end = begin;
                    i = begin - 1;
                }
            } else {
                if(count == maxCount) {
                    res.add(new int[]{begin, end});
                }
                count = 0;
                currentMax = -1;
                currentMin = 31;
                begin++;
                while(begin < N && (indexs[begin] < 18 || indexs[begin] > 24)) {
                    begin++;
                    // System.out.println(begin);
                }
                end = begin;
                i = begin - 1;
            }
        }
        if(count == maxCount) {
            res.add(new int[]{begin, end});
        }
        for(int i = 0; i < res.size(); i++) {
            System.out.println(res.get(i)[0] + " " + res.get(i)[1]);
        }
    }
}