• <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

            欧美噜噜久久久XXX| 久久精品国产亚洲av麻豆色欲| 亚洲国产成人久久综合碰碰动漫3d | 亚洲日本va午夜中文字幕久久| 性做久久久久久久久久久| 久久亚洲精品无码观看不卡| 久久久精品波多野结衣| 91麻豆国产精品91久久久| 久久丫精品国产亚洲av| 久久久国产精品| 国产午夜免费高清久久影院| 久久成人国产精品一区二区| 成人免费网站久久久| 国产亚洲色婷婷久久99精品91| 亚洲一区精品伊人久久伊人 | 国产ww久久久久久久久久| 亚洲精品美女久久久久99小说| 国产午夜免费高清久久影院| 欧美午夜精品久久久久久浪潮| 久久91精品久久91综合| 国产香蕉久久精品综合网| 日韩一区二区久久久久久| 欧美亚洲色综久久精品国产| 久久99精品久久久久久不卡| 国产亚洲婷婷香蕉久久精品 | 久久精品国产亚洲沈樵| 久久久一本精品99久久精品88| 国产精品内射久久久久欢欢| 久久久久人妻精品一区二区三区| 亚洲国产精品狼友中文久久久| 亚洲成人精品久久| 久久综合九色综合欧美狠狠| jizzjizz国产精品久久| 亚洲中文久久精品无码| 久久久久久久久久久久久久| 合区精品久久久中文字幕一区| 久久精品国产99国产精品| 久久精品国产亚洲AV不卡| 国产精品99久久久久久www| 国产69精品久久久久9999| 99精品久久久久久久婷婷|