POJ 题目1505 Copying Books(DP,打印路径)
来源:互联网 发布:宝信软件 600845 编辑:程序博客网 时间:2024/06/05 16:24
Copying Books
Time Limit: 3000MS Memory Limit: 10000KTotal Submissions: 7566 Accepted: 2383
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.
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.
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
29 3100 200 300 400 500 600 700 800 9005 4100 100 100 100 100
Sample Output
100 200 300 400 500 / 600 700 / 800 900100 / 100 / 100 / 100 100
Source
Central Europe 1998
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
题目大意:n个数分成m组,是的这些组中最大的组中数的和尽可能的小,输出这种分法
ac代码
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#define INF 0x3f3f3f3f#define LL long longusing namespace std;int n,m;LL a[505],dp[505][505],sum[505];int b[505];int main(){ int n,m; int t; scanf("%d",&t); while(t--) { int i,j,k; scanf("%d%d",&n,&m); sum[0]=0; for(i=1;i<=n;i++) { scanf("%lld",&a[i]); sum[i]=sum[i-1]+a[i]; } memset(dp,INF,sizeof(dp)); for(i=1;i<=n;i++) dp[1][i]=sum[i]; for(i=2;i<=m;i++) { for(j=i;j<=n;j++) { for(k=i-1;k<j;k++) dp[i][j]=min(dp[i][j],max(dp[i-1][k],sum[j]-sum[k])); } } //printf("%lld\n",dp[m][n]); LL temp; int y=m-1; temp=0; memset(b,0,sizeof(b)); for(i=n;i>0;i--) { temp+=a[i]; if(temp>dp[m][n]) { temp=0; y--; b[i]=1; i++; } if(i<=y) { for(;i>0;i--) b[i]=1; break; } } printf("%lld",a[1]); if(b[1]==1) printf(" /"); for(i=2;i<=n;i++) { printf(" %lld",a[i]); if(b[i]==1) printf(" /"); } printf("\n"); }}
0 0
- POJ 题目1505 Copying Books(DP,打印路径)
- poj 1505 Copying Books (dp+路径打印)
- POJ 1505 Copying Books
- poj 1505 Copying Books
- poj 1505 Copying Books
- poj 1505 Copying Books
- POJ 1505 Copying Books
- 【poj 1505】 Copying Books
- POJ 1505 Copying Books(最小化最大值)
- POJ1505 Copying Books(dp)
- POJ 1505 Copying Books 笔记
- POJ 2955 Brackets & POJ 1505 Copying Books & POJ 1651 Multiplication Puzzle(初级区间DP)
- POJ 1505 Copying Books 二分 + 贪心
- (贪心5.3.2)POJ 1505 Copying Books()
- POJ 1505 (Copying Books)(经典二分)
- poj(1505)——Copying Books
- poj 1505 Copying Books 动态规划
- UVA-714/POJ-1505 Copying Books
- UiObject官方文档,个人翻译
- 第十周项目1—二叉树的链式存储及基本运算
- 第九周项目3—稀疏矩阵的三元组表示的实现及应用(2)
- HUD 1026 纯C代码广搜
- 稀疏矩阵的三元组表示的实现(3.1)
- POJ 题目1505 Copying Books(DP,打印路径)
- mysqldump使用方法
- android 全局获取Context的技巧 《第一行代码》
- 数据库结构初探--引言
- 第十周-项目3 - 利用二叉树遍历思想解决问题
- ZooKeeper典型应用场景一览
- (三):Winelib用户手册2
- 第三周项目--顺序表的应用(删除元素)
- iOS app的测试发布平台