zoukankan      html  css  js  c++  java
  • CodeForces 709A Juicer

    A. Juicer
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Kolya is going to make fresh orange juice. He has n oranges of sizes a1, a2, ..., an. Kolya will put them in the juicer in the fixed order, starting with orange of size a1, then orange of size a2 and so on. To be put in the juicer the orange must have size not exceeding b, so if Kolya sees an orange that is strictly greater he throws it away and continues with the next one.

    The juicer has a special section to collect waste. It overflows if Kolya squeezes oranges of the total size strictly greater than d. When it happens Kolya empties the waste section (even if there are no more oranges) and continues to squeeze the juice. How many times will he have to empty the waste section?

    Input

    The first line of the input contains three integers nb and d (1 ≤ n ≤ 100 0001 ≤ b ≤ d ≤ 1 000 000) — the number of oranges, the maximum size of the orange that fits in the juicer and the value d, which determines the condition when the waste section should be emptied.

    The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1 000 000) — sizes of the oranges listed in the order Kolya is going to try to put them in the juicer.

    Output

    Print one integer — the number of times Kolya will have to empty the waste section.

    Examples
    input
    2 7 10
    5 6
    
    output
    1
    
    input
    1 5 10
    7
    
    output
    0
    
    input
    3 10 10
    5 7 7
    
    output
    1
    
    input
    1 1 1
    1
    
    output
    0
    



    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    #include <math.h>
    
    using namespace std;
    int n,b,d;
    int a[100005];
    int main()
    {
        scanf("%d%d%d",&n,&b,&d);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        int ans=0;
        int sum=0;
        for(int i=1;i<=n;i++)
        {
            if(a[i]>b) continue;
            else sum+=a[i];
            if(sum>d)
                ans++,sum=0;
        }
        printf("%d
    ",ans);
        return 0;
    }


  • 相关阅读:
    c# 与 winform 界面开发
    文件大小的友好输出及其 Python 实现
    bookhub -- 扁平化本地电子书管理与分享工具
    阶段性放弃 wxPython 前的总结
    数据挖掘环境下的个人信息安全
    精益阅读 -- 科技图书的阅读过程管理工具
    wxPython Modal Dialog 模式对话框
    wxPython 基本框架与运行原理 -- App 与 Frame
    JAVA向,二叉查找树
    线性表实践-选票算法
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228590.html
Copyright © 2011-2022 走看看