CCF 201703-1 分蛋糕（100分）

CCF 201703-1 分蛋糕

#include<iostream>

using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;
	int a[1000] = { 0 };
	int g;
	for (int i = 0; i < n; i++)
	{
		cin >> g;
		a[i] = g;
	}
	int count = 0;
	for (int i = 1; i < n+1; i++)
	{
		if (a[i - 1] >= k) {
			count++;
			a[i] = a[i];
		}
		else {
			if (i-1 == n - 1) 
				count++;
			else 
			    a[i] += a[i - 1];
		}
	}
	cout << count << endl;

	system("pause");
	return 0;
}