青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

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 極限定律 閱讀(3629) 評論(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年9月>
31123456
78910111213
14151617181920
21222324252627
2829301234
567891011

導航

統計

常用鏈接

留言簿(10)

隨筆分類

隨筆檔案

友情鏈接

搜索

最新評論

閱讀排行榜

評論排行榜

青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品
  • <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>
            日韩写真在线| 亚洲靠逼com| 久久久久国产精品厨房| 国产视频亚洲精品| 久久夜色精品国产噜噜av| 久久99在线观看| 在线免费观看视频一区| 欧美激情亚洲激情| 欧美日韩国产片| 亚洲一区激情| 翔田千里一区二区| 在线观看亚洲精品| 亚洲人成网站999久久久综合| 免费日韩成人| 亚洲午夜一区二区三区| 午夜精品www| 亚洲国产三级| 在线视频欧美日韩| 国产一区二区三区久久精品| 免费在线看一区| 国产精品久久福利| 免费在线欧美视频| 国产精品久久久久影院亚瑟| 久久综合九色综合久99| 欧美不卡福利| 欧美在线1区| 老司机久久99久久精品播放免费 | 欧美黑人国产人伦爽爽爽| 亚洲社区在线观看| 亚洲国产精品久久久久久女王| 欧美日韩国产成人在线91| 久久久美女艺术照精彩视频福利播放| 美女啪啪无遮挡免费久久网站| 亚洲尤物影院| 欧美电影美腿模特1979在线看| 欧美一区二区高清| 欧美极品影院| 免费亚洲一区二区| 国产欧美日韩亚洲| 99视频一区二区| 亚洲国产黄色片| 亚洲欧美日韩在线一区| 一本一道久久综合狠狠老精东影业| 欧美一区二区三区在线| 亚洲午夜av电影| 欧美超级免费视 在线| 久久男人av资源网站| 欧美性猛交xxxx免费看久久久| 欧美黄色网络| 韩国精品一区二区三区| 午夜精品一区二区三区在线| 亚洲一区视频| 欧美精品一区二区三区四区 | 亚洲欧洲精品一区二区三区| 久久国产精品久久久久久久久久| 午夜精品免费在线| 欧美日韩在线播放一区二区| 亚洲高清一区二区三区| 1024精品一区二区三区| 久久激情综合| 久久久人人人| 黄色在线一区| 久久婷婷蜜乳一本欲蜜臀| 久久久久久夜| 好吊一区二区三区| 久久se精品一区二区| 久久精品国产综合精品| 国产日韩亚洲欧美精品| 亚洲欧美日韩国产一区二区三区| 亚洲午夜精品网| 欧美三区在线视频| 亚洲午夜精品久久久久久app| 亚洲午夜羞羞片| 国产精品久久久久久久久动漫| 在线午夜精品自拍| 香蕉成人久久| 国产主播一区二区三区| 久久久亚洲精品一区二区三区| 猛干欧美女孩| 一区二区三区不卡视频在线观看| 欧美日韩精品久久久| 亚洲已满18点击进入久久| 欧美自拍丝袜亚洲| 亚洲大胆人体视频| 欧美激情一区二区三级高清视频| 99re6这里只有精品| 亚洲欧美国产制服动漫| 国产亚洲a∨片在线观看| 久久中文字幕一区| 亚洲国产成人久久综合| 一区二区三区国产精华| 国产欧美日韩一级| 免费视频一区二区三区在线观看| 亚洲国产综合91精品麻豆| 亚洲欧美国产高清| 亚洲第一久久影院| 欧美体内she精视频| 久久久7777| 日韩一本二本av| 另类激情亚洲| 亚洲午夜久久久| 悠悠资源网亚洲青| 欧美午夜视频网站| 久久夜色撩人精品| 亚洲午夜电影| 亚洲第一页在线| 欧美影院久久久| 99re6热只有精品免费观看 | 美日韩精品视频| 亚洲一区二三| 亚洲激情视频网| 亚洲国产精品欧美一二99| 国产精品乱码一区二区三区| 久久综合九色九九| 午夜精品久久久久影视| 亚洲精品综合久久中文字幕| 看欧美日韩国产| 欧美亚洲一区三区| 一区二区三区日韩精品视频| 在线国产精品播放| 国产一区二区激情| 国产精品青草久久| 欧美日韩一区二区高清| 欧美成人亚洲成人| 久久亚洲精品网站| 欧美在线免费视频| 性视频1819p久久| 亚洲一区二区视频在线观看| 99精品视频一区二区三区| 亚洲激情亚洲| 亚洲第一精品在线| 女人天堂亚洲aⅴ在线观看| 久久久久久久久久久久久9999 | 国产色爱av资源综合区| 欧美系列电影免费观看| 欧美激情一二三区| 欧美精品在线视频| 欧美经典一区二区三区| 欧美高清自拍一区| 欧美成人午夜| 欧美黄色成人网| 欧美1区2区| 欧美精品色综合| 欧美日韩的一区二区| 欧美日韩国产精品一区| 欧美色大人视频| 国产精品qvod| 国产毛片精品国产一区二区三区| 国产精品大全| 国产伦精品一区二区三区四区免费| 国产精品久久久久9999高清| 国产精品日韩久久久久| 国产免费成人av| 韩国一区二区三区美女美女秀| 国产一区二区精品| 亚洲国产欧美一区二区三区久久 | 激情婷婷欧美| 亚洲激情综合| 亚洲一区二区动漫| 欧美一区二区三区在| 久久久久久久综合日本| 欧美a级片一区| 亚洲美女中文字幕| 亚洲免费在线| 老巨人导航500精品| 欧美区在线观看| 国产免费一区二区三区香蕉精| 国产亚洲网站| 亚洲肉体裸体xxxx137| 亚洲一区二区精品视频| 久久久久久国产精品mv| 亚洲第一精品福利| 亚洲一区免费网站| 免费观看成人网| 国产精品久久久久久福利一牛影视| 激情久久一区| 亚洲视频在线一区| 免费日韩av电影| 一区二区三区色| 另类av一区二区| 国产精品网站在线| 亚洲日本视频| 久久久国际精品| 亚洲毛片av| 久久婷婷蜜乳一本欲蜜臀| 欧美视频免费看| 亚洲激情成人在线| 久久国产精品免费一区| 亚洲国产一区二区视频| 久久国产精彩视频| 国产精品国产a| 亚洲人成网站影音先锋播放| 欧美综合77777色婷婷| 亚洲毛片网站| 美女久久一区| 黄色精品一区| 久久精品91| 亚洲永久免费| 欧美日本三区| 亚洲精选视频免费看|