• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            ArcTan

            dfs
            隨筆 - 16, 文章 - 117, 評論 - 6, 引用 - 0
            數據加載中……

            SRM 150 DIV 2 250pt(隊列)

            Problem Statement

                

            When a widget breaks, it is sent to the widget repair shop, which is capable of repairing at most numPerDay widgets per day. Given a record of the number of widgets that arrive at the shop each morning, your task is to determine how many days the shop must operate to repair all the widgets, not counting any days the shop spends entirely idle.

            For example, suppose the shop is capable of repairing at most 8 widgets per day, and over a stretch of 5 days, it receives 10, 0, 0, 4, and 20 widgets, respectively. The shop would operate on days 1 and 2, sit idle on day 3, and operate again on days 4 through 7. In total, the shop would operate for 6 days to repair all the widgets.

            Create a class WidgetRepairs containing a method days that takes a sequence of arrival counts arrivals (of type vector <int>) and an int numPerDay, and calculates the number of days of operation.

            Definition

                
            Class: WidgetRepairs
            Method: days
            Parameters: vector <int>, int
            Returns: int
            Method signature: int days(vector <int> arrivals, int numPerDay)
            (be sure your method is public)
                

            Constraints

            - arrivals contains between 1 and 20 elements, inclusive.
            - Each element of arrivals is between 0 and 100, inclusive.
            - numPerDay is between 1 and 50, inclusive.

            Examples

            0)
                
            { 10, 0, 0, 4, 20 }
            8
            Returns: 6
            The example above.
            1)
                
            { 0, 0, 0 }
            10
            Returns: 0

            2)
                
            { 100, 100 }
            10
            Returns: 20

            3)
                
            { 27, 0, 0, 0, 0, 9 }
            9
            Returns: 4

            4)
                
            { 6, 5, 4, 3, 2, 1, 0, 0, 1, 2, 3, 4, 5, 6 }
            3
            Returns: 15

            This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.



            直接遍歷就行,每天完成不了的留到第二天做。最后沒有完成的延遲到后面做。
            求的的做的天數是多少,沒有做的那天不用算。

            228PT,速度還是慢了點。
            #include<stdio.h>
            #include
            <algorithm>
            #include
            <string.h>
            #include
            <vector>
            using namespace std;

            class WidgetRepairs{
            public:
                
            int days(vector <int> arrivals, int numPerDay){
                    
            int n=arrivals.size();
                    
            int now=0;
                    
            int i=0;
                    
            int tot=0;
                    
            while (i<|| now)  //這里可以優化一下,如果i==n就不用循環了,剩下的需要完成的天數為(now-1)/numPerDay+1。
                    {
                        
            if (i<n)
                            now
            +=arrivals[i];
                        
            if (now>0)   //第一次這里理解錯了,以后要把細節搞清楚啊。。。
                            tot++;
                        now
            =now>numPerDay?now-numPerDay:0;    
                        i
            ++;
                    }
                    
            return tot;
                }
            };







            posted on 2012-07-15 21:37 wangs 閱讀(228) 評論(0)  編輯 收藏 引用 所屬分類: Topcoder

            精品视频久久久久| 亚洲综合精品香蕉久久网| 99久久久精品| 久久精品中文字幕第23页| 久久免费视频1| 91久久精品视频| 熟妇人妻久久中文字幕| 久久久久99精品成人片牛牛影视| 婷婷国产天堂久久综合五月| 久久久久中文字幕| 久久国产免费直播| 久久涩综合| 久久99精品久久久久久齐齐| 久久ZYZ资源站无码中文动漫| 四虎久久影院| 91精品国产综合久久香蕉| 久久久久亚洲AV片无码下载蜜桃 | 国产亚洲精午夜久久久久久| 中文字幕热久久久久久久| 狠狠色综合久久久久尤物 | 亚洲狠狠综合久久| 久久香蕉超碰97国产精品| 人妻无码精品久久亚瑟影视| 久久精品国产亚洲7777| 亚洲精品高清国产一久久| 国产精品久久影院| 99久久99这里只有免费的精品| 亚洲综合日韩久久成人AV| 久久久久亚洲AV无码观看| 青青热久久国产久精品 | 婷婷久久香蕉五月综合加勒比| 欧美成a人片免费看久久| 久久av免费天堂小草播放| 国产精品美女久久久久av爽 | 韩国三级中文字幕hd久久精品| 青青草国产成人久久91网| 99久久www免费人成精品| 国产亚洲精久久久久久无码AV| 精品无码久久久久久久久久| 久久久青草青青国产亚洲免观| 深夜久久AAAAA级毛片免费看|