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

#include <stdio.h>

int main() {
    int N;
    int S[100000] = {0};
    int get1[100000] = {0};
    int get2[100000] = {0};
    int get3[100000] = {0};
    int get3_big = 0;
    int get_sort = 0;
    // int get_end=0;
    // int temp;
    scanf("%d", &N);
    for (int i = 0; i < N; i++)
        scanf("%d", &S[i]);
    int i = 0;
    while (i < N) {
        // printf("%d",S[i]);

        if ((S[i] >= 18) && (S[i] <= 24)) {
            int j;
            int lower = S[i];
            int higher = S[i];
            // printf("%d\n",lower);
            for (j = i+1 ; j < N; j++) {
                if (S[j] < 18 || S[j] > 24)  {
                    break;
                }
                else {
                    lower = (lower > S[j]) ? S[j] : lower;
                    higher = (higher < S[j]) ? S[j] : higher;
                    if (higher - lower > 4) {
                        break;
                    }
                }
            }
                // printf("%d ", i);
                get1[get_sort] = i;
                get2[get_sort] = j - 1;
                get3[get_sort] = j - 1 - i;
                if (get3[get_sort] > get3_big)
                    get3_big = get3[get_sort];
                get_sort++;

            if((S[j] < 18 || S[j] > 24))
            i=j-1;
        }
        i++;
        // printf("%d ", i);
    }

    for (int i = 0; i < get_sort; i++) {
        if (get3[i]==get3_big)
        {
            printf("%d ", get1[i]);
            printf("%d\n", get2[i]);
            // printf("%d\n",get_sort);
        }
    }
}