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

            POJ 1505 Copying Books 動態規劃

            Description

            Before the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so called scribers. The scriber had been given a book and after several months he finished its copy. One of the most famous scribers lived in the 15th century and his name was Xaverius Endricus Remius Ontius Xendrianus (Xerox). Anyway, the work was very annoying and boring. And the only way to speed it up was to hire more scribers.

            Once upon a time, there was a theater ensemble that wanted to play famous Antique Tragedies. The scripts of these plays were divided into many books and actors needed more copies of them, of course. So they hired many scribers to make copies of these books. Imagine you have m books (numbered 1, 2 ... m) that may have different number of pages (p1, p2 ... pm) and you want to make one copy of each of them. Your task is to divide these books among k scribes, k <= m. Each book can be assigned to a single scriber only, and every scriber must get a continuous sequence of books. That means, there exists an increasing succession of numbers 0 = b0 < b1 < b2, ... < bk-1 <= bk = m such that i-th scriber gets a sequence of books with numbers between bi-1+1 and bi. The time needed to make a copy of all the books is determined by the scriber who was assigned the most work. Therefore, our goal is to minimize the maximum number of pages assigned to a single scriber. Your task is to find the optimal assignment.

            Input

            The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly two lines. At the first line, there are two integers m and k, 1 <= k <= m <= 500. At the second line, there are integers p1, p2, ... pm separated by spaces. All these values are positive and less than 10000000.

            Output

            For each case, print exactly one line. The line must contain the input succession p1, p2, ... pm divided into exactly k parts such that the maximum sum of a single part should be as small as possible. Use the slash character ('/') to separate the parts. There must be exactly one space character between any two successive numbers and between the number and the slash.

            If there is more than one solution, print the one that minimizes the work assigned to the first scriber, then to the second scriber etc. But each scriber must be assigned at least one book.

            Sample Input

            2
            9 3
            100 200 300 400 500 600 700 800 900
            5 4
            100 100 100 100 100

            Sample Output

            100 200 300 400 500 / 600 700 / 800 900
            100 / 100 / 100 / 100 100

            Source

                 

                假設有M本書(編號為12M),想將每本復制一份,M本書的頁數可能不同(分別是P1P2PM)。任務時將這M本書分給K個抄寫員(KM〉,每本書只能分配給一個抄寫員進行復制,而每個抄寫員所分配到的書必須是連續順序的。

                意思是說,存在一個連續升序數列0=b0b1b2bk-1bk=m,這樣,第i號抄寫員得到的書稿是從bi-1+1到第bi本書。復制工作是同時開始進行的,并且每個抄寫員復制的速度都是一樣的。所以,復制完所有書稿所需時間取決于分配得到最多工作的那個抄寫員的復制時間。試找一個最優分配方案,使分配給每一個抄寫員的頁數的最大值盡可能小(如存在多個最優方案,只輸出其中一種)。
                設dp[i,j]表示前j個人復制前i本書所需要的最少時間,有狀態轉移方程dp[i,j]=min(dp[i,j],max(dp[v,j-1],sum[v+1,i])),其中1<=i<=m,1<=j<=k,j-1<=v<=i-1,sum[v+1,j]表示第v+1本書到第i本書的頁數之和。

            #include<iostream>
            using namespace std;

            const int MAXN = 510;
            int sum[MAXN],path[MAXN],dp[MAXN][MAXN];

            int main(){
                
            int m,k,i,j,v,ca,p,t;
                scanf(
            "%d",&ca);
                
            while(ca--){
                    scanf(
            "%d %d",&m,&k);
                    
            for(sum[0]=0,i=1;i<=m;i++){
                        scanf(
            "%d",&p);
                        sum[i]
            =sum[i-1]+p;
                    }

                    memset(dp,
            -1,sizeof(dp));
                    
            for(dp[0][0]=0,i=1;i<=m;i++)
                        
            for(j=1;j<=&& j<=k;j++){
                            
            if(j==1) dp[i][j]=sum[i];
                            
            else
                                
            for(v=j-1;v<=i-1;v++){
                                    t
            =max(dp[v][j-1],sum[i]-sum[v]);
                                    
            if(dp[i][j]==-1 || t<=dp[i][j]) 
                                        dp[i][j]
            =t;
                                }

                        }

                    
            for(i=m,j=k-1,p=0;i>=1;i--){
                        p
            +=sum[i]-sum[i-1];
                        
            if(p>dp[m][k] || i<=j){
                            path[j
            --]=i+1;
                            p
            =sum[i]-sum[i-1];
                        }

                    }

                    
            for(i=j=1;i<=m;i++){
                        
            if(i>1) printf(" ");
                        
            if(j<&& path[j]==i){
                            printf(
            "");
                            j
            ++;
                        }

                        printf(
            "%d",sum[i]-sum[i-1]);
                    }

                    printf(
            "\n");
                }

                
            return 0;
            }

            posted on 2009-06-16 09:59 極限定律 閱讀(3576) 評論(12)  編輯 收藏 引用 所屬分類: ACM/ICPC

            評論

            # re: POJ 1505 Copying Books 動態規劃 2009-06-16 22:30 bafangprinter

            China-Beijing bafang printing plant,Offers business printing services ,Full colour printing service for brochures,paper bag,newsletters,magazines,catalogues,Boxprinting,Paper processing,Drugs ,Business Cards, Box,Jewel box,Gift box,Kraft paper bags,Corrugated Box,Beijing Printing, Foreigners in China ,All are welcome to the Advisory order! TEL:86-010-51665543 MSN:beijingbafang@hotmail.com http://www.print861.com Fengtai District Beijing  China   回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2009-11-17 22:21 Gamor

            二分最大值也可以過。  回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2010-07-18 19:33 AnnetteKRAMER

            I would like to propose not to hold back until you get enough amount of cash to buy different goods! You can just get the <a href="http://bestfinance-blog.com/topics/personal-loans">personal loans</a> or just secured loan and feel yourself comfortable   回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2010-08-02 17:01 buy essay

            Study process demands creative writing skills, nevertheless, college students, which don't have time can fail their academic career. Hence, to purchase the term papers from the buy term paper service would be a right decision.   回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2010-08-05 16:36 term paper

            This is what I was exploring for a long time! Thanks for this article around university! One time somebody state that In union there is effect. Our powerfully skilled service can help you in writing custom research papers.  回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2010-08-11 20:30 essay writing service

            Do you work a lot on your writing assignment? You do not have to bother about that any longer, because you can buy essay papers.   回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃[未登錄] 2010-09-25 11:15 dress

            Best canon Coffee Mugs! Funny, Cute, & Humorous Unique designs. Also find Travel Mugs, Coffee Cups also, or Create Photo Personalized Mugs & Drinkware  回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2012-02-11 12:45 resume writing

            The article you post by scribers is very interesting, now we understand how xerox copy machine came to being, its a great info.  回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2012-04-17 16:09 help in writing term papers

            This article defines how things came to being,here i found so many information related to copying books and machines.Its nice to read this book.  回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃[未登錄] 2013-05-12 19:40 BETTY

            格式有點囧  回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2013-06-17 20:01 this site

            Go to Perfect-resume company (perfect-resume.com) if you are in need of reliable resume services. Having delt with this trustable agency, you will be aware of which service to choose for buying resume and where to look through samples of resume writing. Don’t mull over, buy CV of good quality from expert resume writers.  回復  更多評論   

            # re: POJ 1505 Copying Books 動態規劃 2013-06-17 20:02 Internet site

            Professional resume writers review will hint you where to buy resume paper if you are too busy to write a resume, just visit Resumes expert company resumesexpert.com, view resume writing samples and our certified resume writers will be ready to provide you best CV writing. Buying resume with us is pretty easy, buy resumes now and stay satisfied about your career.  回復  更多評論   

            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            導航

            統計

            常用鏈接

            留言簿(10)

            隨筆分類

            隨筆檔案

            友情鏈接

            搜索

            最新評論

            閱讀排行榜

            評論排行榜

            国产午夜免费高清久久影院| 国产伊人久久| 久久亚洲AV成人无码国产| 精品久久一区二区| 久久综合精品国产一区二区三区| 日韩欧美亚洲综合久久| 国产精品久久毛片完整版| 亚洲婷婷国产精品电影人久久| 欧美日韩精品久久免费| 欧美日韩中文字幕久久伊人| 漂亮人妻被中出中文字幕久久| 99久久免费国产精品热| 久久精品国产亚洲AV香蕉| 91麻豆精品国产91久久久久久| 99久久精品国产一区二区| 国产精品免费久久| 久久国产一区二区| 香蕉久久av一区二区三区| 亚洲国产成人久久精品99| 久久夜色精品国产亚洲| 麻豆AV一区二区三区久久| 精品久久久一二三区| 看全色黄大色大片免费久久久| 久久精品国产免费| 97精品伊人久久大香线蕉app| 国产精品久久久久免费a∨| 精品人妻伦一二三区久久| 99精品伊人久久久大香线蕉| 2021久久国自产拍精品| 久久亚洲精品人成综合网| 亚洲精品无码久久久久| 久久国语露脸国产精品电影| 香蕉久久夜色精品国产尤物| 久久青青国产| 久久99热这里只有精品66| 精品久久久久久国产| 日本欧美久久久久免费播放网 | 污污内射久久一区二区欧美日韩| 国产精品毛片久久久久久久| 久久久久久无码Av成人影院| 国产精品久久成人影院|