传送门Codeforces Round #249 (Div. 2) A - Queue on Bus Stop
水题。
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
//freopen("input.txt", "r", stdin);
int n, m, i, j, cnt, cur;
int num[110];
while (~scanf("%d%d", &n, &m))
{
cnt = 1;
cur = m;
for (i = 0; i < n; i++)
scanf("%d", &num[i]);
for (i = 0; i < n; i++)
{
if (cur >= num[i])
cur -= num[i];
else
{
cur = m;
cnt++;
i--;
}
}
printf("%d\n", cnt);
}
return 0;
}