Caravans arrive at the willow walks of Reedmarsh with crates of stretches, and Wamika the accountant must account for every last one. Task: All values are positive. Print the length of the shortest contiguous subarray whose sum is at least s, or 0 if none. Input format: First line: n and s. Second line: n positive integers. Output format: Print the minimum length, or 0 if impossible. Constraints: 1 <= n <= 2960; 1 <= a[i] <= 1000; 1 <= s <= 10^18.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2960; 1 <= a[i] <= 1000; 1 <= s <= 10^18.
