영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given a cyclic array consisting of n values. Each element has two neighbors; the elements at positions n and 1 are also considered neighbors.
Your task is to divide the array into subarrays so that the sum of each subarray is at most k. What is the minimum number of subarrays?
Input
The first input line contains integers n and k.
The next line has n integers x_1,x_2,…,x_n: the contents of the array.
There is always at least one division (i.e., no value in the array is larger than k).
Output
Print one integer: the minimum number of subarrays.
Constraints
- 1 ≤ n ≤ 2 · 10^5
- 1 ≤ x_i ≤ 10^9
- 1 ≤ k ≤ 10^18
Example
Explanation: We can create three subarrays: [2,2,1], [3,1], and [2,1,2] (remember that the array is cyclic).
예제
예제 1
8 5 2 2 2 1 3 1 2 1
3