cf435A Queue on Bus Stop
来源:互联网 发布:按键精灵调用js 编辑:程序博客网 时间:2024/05/01 22:44
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 ai people. 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.
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).
Print a single integer — the number of buses that is needed to transport all n groups to the dacha countryside.
4 32 3 2 1
3
3 41 2 1
1
#include<cstdio>#include<iostream>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>using namespace std;#define inf 0x7fffffff#define LL long long#define read fastreading()inline int fastreading(){ int x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f;}int a[1000];int n,m,ans,s;int main(){ n=read; m=read; for (int i=1;i<=n;i++) {a[i]=read;if (a[i]+s<=m) {s+=a[i];}else {ans++;s=a[i];}if (a[i]==m){ans++;s=0;}} if (s) ans++; cout<<ans;}
- cf435A Queue on Bus Stop
- Queue on Bus Stop
- A. Queue on Bus Stop
- A. Queue on Bus Stop
- B-Queue on Bus Stop
- B-Queue on Bus Stop
- Queue on Bus Stop CodeForces
- Codeforces 435A Queue on Bus Stop
- Codeforces 435A Queue on Bus Stop
- Codeforces Round #249 (Div. 2) A. Queue on Bus Stop
- codeforces 435A Queue on Bus Stop(模拟水题)
- Codeforces Round #249 (Div. 2) A - Queue on Bus Stop
- CodeForces NO.435A Queue on Bus Stop(汽车载人)
- On a bus
- B. Seating On Bus
- B. Seating On Bus
- Seating On Bus
- Seating On Bus
- Ubuntu 14.04 安装配置 cairo-dock 实现美化+特效
- 总结一下web backend技术(2015年1月)
- leetcode-Word Ladder II
- 关于正则表达式的先行断言(lookahead)和后行断言(lookbehind)的理解
- TimesTen手动主备切换(ASP模式)[TimesTen运维基础]
- cf435A Queue on Bus Stop
- windows编程之文件夹遍历
- findstr正则
- jquery总结(2)
- jquery总结(2)
- Web基础架构:负载均衡和LVS
- Excel列防重复公式
- html学习笔记
- [Cocos2d-x v3.x]浅谈容器Vector