A. Queue on Bus Stop
2014-06-03 16:10
741 查看
A. Queue on Bus Stop
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
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.
#include<iostream>
#include <stdio.h>
#define maxn 105
using namespace std;
int main()
{
int num[maxn] = {0};
int n,m;
int sum = 0;
int ans = 0;
scanf("%d %d",&n, &m);
for( int i = 0; i<n ;i++)
{
scanf("%d",&num[i]);
if(sum + num[i] > m)
{
sum = num[i];
ans++;
}
else
sum += num[i];
}
if( sum > 0)
ans ++;
printf("%d\n",ans);
}
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
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.
#include<iostream>
#include <stdio.h>
#define maxn 105
using namespace std;
int main()
{
int num[maxn] = {0};
int n,m;
int sum = 0;
int ans = 0;
scanf("%d %d",&n, &m);
for( int i = 0; i<n ;i++)
{
scanf("%d",&num[i]);
if(sum + num[i] > m)
{
sum = num[i];
ans++;
}
else
sum += num[i];
}
if( sum > 0)
ans ++;
printf("%d\n",ans);
}
相关文章推荐
- B-Queue on Bus Stop
- Codeforces Round #249 (Div. 2) A - Queue on Bus Stop
- Codeforces 435 A. Queue on Bus Stop
- Queue on Bus Stop
- A. Queue on Bus Stop
- Codeforces 435 A Queue on Bus Stop
- Codeforces Round #249 (Div. 2) A. Queue on Bus Stop
- Codeforces Round #249 (Div. 2) A. Queue on Bus Stop
- cf435A Queue on Bus Stop
- Codeforces Round #249 (Div. 2) A - Queue on Bus Stop
- cf435A Queue on Bus Stop
- How to Configure, Install and Use libnefilter_queue on Linux
- onPause和onStop的区别
- Android Activity为什么要细化出onCreate、onStart、onResume、onPause、onStop、onDesdroy这么多方法让应用去重载?
- Android生命周期中的onPause()和onStop()
- android之生命周期(二)onPause()、onResume()、onStop()详解:有实例
- Activity生命周期:onCreate onStart onResume onPause onStop onDestory (1) 启动Activity: onCreate onStart onR
- 正确处理 Azure OnStop 事件
- B. Seating On Bus
- Modem Device on High Definition Audio Bus