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

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.  回復  更多評論   

<2009年6月>
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>
            欧美一区国产一区| 欧美主播一区二区三区| 欧美激情成人在线| 亚洲国产清纯| 日韩视频在线观看国产| 国产精品高清一区二区三区| 欧美一区二区高清| 久久综合中文| 中文日韩欧美| 欧美一区日韩一区| 亚洲激情六月丁香| 亚洲视频在线免费观看| 国产一区二区三区在线观看免费| 欧美 日韩 国产一区二区在线视频 | 一区二区在线不卡| 亚洲电影av在线| 欧美手机在线视频| 久久只精品国产| 欧美日韩国产成人在线91| 亚洲综合二区| 久久一区二区三区av| 亚洲图片欧美一区| 六月丁香综合| 亚洲欧美在线一区| 麻豆91精品| 欧美一区久久| 欧美精品粉嫩高潮一区二区| 欧美在线网址| 欧美日韩一区在线观看| 久久综合久久综合久久综合| 91久久久久| 国产一区二区三区四区| 久久三级视频| 欧美日韩一区二区在线| 女主播福利一区| 国产日本欧美视频| 一本久道久久久| 亚洲精品久久久蜜桃| 亚洲免费在线播放| 亚洲欧美国产不卡| 欧美精品色综合| 欧美搞黄网站| 国内精品久久久久久久果冻传媒| 99视频精品在线| 亚洲三级视频| 欧美成人一区二区三区| 美国成人毛片| 国产在线成人| 先锋影音国产一区| 欧美一区二区三区在线视频 | 欧美99在线视频观看| 国产精品午夜视频| 亚洲美女毛片| 99精品国产高清一区二区 | 亚洲欧洲日产国产综合网| 亚洲第一页中文字幕| 久久久久国产精品午夜一区| 久久久精品动漫| 国产亚洲网站| 久久精品二区| 欧美 日韩 国产 一区| 在线观看免费视频综合| 久久伊人精品天天| 欧美成人激情视频免费观看| 一区在线影院| 麻豆精品在线播放| 亚洲国产小视频| 亚洲开发第一视频在线播放| 欧美精品18videos性欧美| 亚洲国产一区二区a毛片| 亚洲免费大片| 欧美色偷偷大香| 亚洲欧美日韩专区| 久久尤物电影视频在线观看| 在线看片欧美| 欧美激情第9页| 99re热这里只有精品免费视频| 亚洲一区二区3| 国产目拍亚洲精品99久久精品| 香蕉免费一区二区三区在线观看| 久久午夜国产精品| 亚洲精品一区中文| 国产精品高潮久久| 久久精品1区| 亚洲精品精选| 欧美中文字幕视频| 在线日韩中文字幕| 欧美日韩国产123| 亚洲在线观看视频| 欧美黄色大片网站| 亚洲综合色视频| 国内揄拍国内精品久久| 欧美国产国产综合| 亚洲欧美日韩一区二区| 欧美激情网友自拍| 午夜伦理片一区| 亚洲黄色成人| 国产精品你懂的在线| 乱人伦精品视频在线观看| 99天天综合性| 蜜桃久久av一区| 亚洲在线观看视频| 亚洲国产另类精品专区| 国产精品免费一区二区三区观看| 久久夜色精品国产噜噜av| 亚洲天堂成人| 亚洲欧洲精品一区二区三区| 久久成人久久爱| 宅男精品视频| 91久久在线观看| 国内精品亚洲| 国产精品免费观看在线| 欧美日本成人| 久久色在线观看| 亚洲一区二区三区久久| 最近看过的日韩成人| 久久色在线观看| 欧美一区不卡| 亚洲影视在线| 99国产精品99久久久久久粉嫩| 黄色成人片子| 国产欧美视频一区二区三区| 欧美日本国产一区| 欧美黄色一级视频| 美女日韩在线中文字幕| 久久精品女人| 午夜视频一区| 在线中文字幕一区| 一区二区高清在线观看| 亚洲日本激情| 亚洲国产精品成人综合| 欧美暴力喷水在线| 欧美 日韩 国产在线| 久久久久**毛片大全| 亚洲欧美在线免费| 亚洲欧美日本视频在线观看| 亚洲一区二区三区乱码aⅴ蜜桃女| 亚洲精品乱码久久久久久按摩观| 亚洲国产另类精品专区| 亚洲国产天堂网精品网站| 亚洲国产精品成人va在线观看| 在线观看国产日韩| 狠狠v欧美v日韩v亚洲ⅴ| 国内精品一区二区三区| 在线视频观看日韩| 最新国产乱人伦偷精品免费网站| 亚洲激情网站| 一区二区高清视频在线观看| 在线视频精品| 亚洲欧美日韩精品久久久| 欧美亚洲一区三区| 久久午夜电影| 亚洲国产成人久久综合| 亚洲精品一级| 亚洲一区二区三区涩| 亚欧成人在线| 免费成人高清视频| 欧美日韩精品二区| 国产欧美日韩精品专区| 一区二区亚洲精品| 一区二区久久久久久| 亚洲欧美日韩国产一区二区| 久久成人精品电影| 奶水喷射视频一区| 99这里只有久久精品视频| 亚洲欧美日韩在线播放| 久久蜜桃精品| 国产精品va在线| 狠狠色噜噜狠狠色综合久| 亚洲欧洲在线播放| 亚洲欧美激情视频| 欧美sm极限捆绑bd| 亚洲视频在线看| 久久综合导航| 国产精品嫩草99av在线| 亚洲电影自拍| 欧美在线免费看| 亚洲国产精品嫩草影院| 亚洲免费影视| 欧美精品一区二区在线观看| 国产亚洲福利| 国产精品99久久不卡二区| 久久亚洲欧美| 在线亚洲欧美视频| 欧美不卡视频一区| 国内精品久久久久影院优| 中国av一区| 麻豆精品视频在线观看| 一区二区日本视频| 免费在线观看日韩欧美| 国产视频久久久久| 亚洲一区欧美一区| 亚洲激情网址| 久久躁日日躁aaaaxxxx| 国产精品最新自拍| 亚洲图片欧洲图片av| 亚洲欧洲视频| 免费成人性网站| 激情六月婷婷综合| 久久精品国产一区二区三区|