CodeForces - 435A Queue on Bus Stop_bus stop csdn-CSDN博客

本文链接：https://blog.csdn.net/S_999999/article/details/84202453

本文介绍了一种基于俄罗斯乡村巴士调度场景的算法问题，旨在解决如何最有效地将多个小组的人群运送至乡村别墅区（dacha）。算法考虑了每30分钟一班的巴士载客量限制以及各小组人数，确保同一小组成员不会被拆分到不同巴士上，同时最小化所需的巴士数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

It's that time of the year when the Russians flood their countryside summer cottages (dachas) and the bus stop has a lot of people. People rarely go to the dacha on their own, it's usually a group, so the people stand in queue by groups.

The bus stop queue has n groups of people. The i-th group from the beginning has aipeople. Every 30 minutes an empty bus arrives at the bus stop, it can carry at most m people. Naturally, the people from the first group enter the bus first. Then go the people from the second group and so on. Note that the order of groups in the queue never changes. Moreover, if some group cannot fit all of its members into the current bus, it waits for the next bus together with other groups standing after it in the queue.

Your task is to determine how many buses is needed to transport all n groups to the dacha countryside.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 100). The next line contains n integers: a1, a2, ..., an (1 ≤ ai ≤ m).

Output

Print a single integer — the number of buses that is needed to transport all n groups to the dacha countryside.

Examples

Input

4 3
2 3 2 1

Output

Input

3 4
1 2 1

// 这个题，要求每个组，必须都在一辆车上， 
// 不能把一个组的人,放在2个公交车上
// 其它的，都很基本了。
#include<iostream>
using namespace std;
int main(void){
	
	int n,m;
	while( scanf("%d%d",&n,&m)!=EOF){
		
		int ans=0;
		int a[109];
		for( int i=1;i<=n;i++)
		    scanf("%d",&a[i]);
		
	    int cur = 1;
	    while(  cur <=n ){
	    	int sum = 0;
	    	while( cur<=n &&  m- sum >=a[cur] ){
	    		sum+=a[cur];
	    		cur++;
			}  
		   ans++;    
	 	}
		printf("%d\n",ans);
	}
 	return 0;
}

Output