import java.util.*;

public class MaxPrizes {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] pos = new int[n];
        for (int i = 0; i < n; i++) pos[i] = sc.nextInt();
        int k = sc.nextInt();
        System.out.println(maxPrizes(pos, k));
    }

    public static int maxPrizes(int[] p, int k) {
        int n = p.length;
        int[] left = new int[n];
        int[] right = new int[n];

        int l = 0;
        for (int r = 0; r < n; r++) {
            while (p[r] - p[l] > k) l++;
            left[r] = r - l + 1;
            if (r > 0) left[r] = Math.max(left[r], left[r - 1]);
        }

        int r = n - 1;
        for (int i = n - 1; i >= 0; i--) {
            while (p[r] - p[i] > k) r--;
            right[i] = r - i + 1;
            if (i < n - 1) right[i] = Math.max(right[i], right[i + 1]);
        }

        int max = 0;
        for (int i = 0; i < n - 1; i++) max = Math.max(max, left[i] + right[i + 1]);
        max = Math.max(max, left[n - 1]);

        return max;
    }
}

Quest to maximize prizes // segment cloud

@Mrtrueliving_ix ✊🏻

🎉 Virtusa NeuralHack 2025 – Only for 2025 Batch 🎉

AUTORabit sending R2 mails ✓