码迷,mamicode.com
首页 > 其他好文 > 详细

Codeforces Round #249 (Div. 2) A - Queue on Bus Stop

时间:2014-06-10 16:38:18      阅读:226      评论:0      收藏:0      [点我收藏+]

标签:class   blog   code   color   com   os   

水题

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main(){
    int n,m;
    cin >> n >> m;
    int cnt = 0, sum = 0;
    for(int i = 0 ; i < n; ++ i){
        int a;
        cin >> a;
        if(sum + a > m){
            cnt++;
            sum = a;
        }else if(sum+a == m){
            cnt++;
            sum = 0;
        }else{
            sum +=a;
        }
    }
    if(sum > 0) cnt++;
    cout<<cnt<<endl;
}

  

Codeforces Round #249 (Div. 2) A - Queue on Bus Stop,布布扣,bubuko.com

Codeforces Round #249 (Div. 2) A - Queue on Bus Stop

标签:class   blog   code   color   com   os   

原文地址:http://www.cnblogs.com/xiongqiangcs/p/3779715.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!