영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
Maja is tired of the coast being taken up by large seaside plots and instead wants to create a long, beautiful beach for public use. She is now planning to buy a segment of plots along the coast to create the beach.
Maja has a budget of B kronor, and the plots along the coast cost A_1, A_2, …, A_N kr from left to right. What is the longest segment of plots that Maja can afford to buy?
Input
The first line contains two integers N (1 ≤ N ≤ 10^5), the number of plots, and B (0 ≤ B ≤ 10^9), Maja's budget.
The second line contains the N integers A_1, A_2, …, A_N (1 ≤ A_i ≤ 1,000), where A_i is the price of plot i.
Output
Print a single integer: the largest number of consecutive plots Maja can afford to buy.
Scoring
Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 20 | N ≤ 500 and all A_i has the same value. |
| 2 | 30 | N ≤ 500 |
| 3 | 50 | No additional constraints. |
예제
예제 1
3 14 4 7 3
3
예제 2
4 36 11 5 7 14
3
예제 3
9 18 1 5 3 4 6 2 1 2 4
6