uVa 714 (二分法)

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

 

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 ) that may have different number of pages ( ) and you want to make one copy of each of them. Your task is to divide these books among k scribes, . 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 such that i-th scriber gets a sequence of books with numbers between b_i-1+1 and b_i. 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, . At the second line, there are integers 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 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

---

Miguel A. Revilla
2000-02-15

程序分析：题目大意是要抄N本书，编号为1，2，3……N，每本书有1<=x<=10000000页，把这些书分配给K个抄写员，要求分配给某个抄写员的那些书的编号必须是连续的，每个抄写员的速度是相同的，求所有书抄完所用最少时间的分配方案。此题不但用到的二分法，同时在输出的时候也用到的贪心算法，还有一个值得注意的地方就是如果把X，Y，MID定义成int型会导致数据的溢出所以我们应该使用long long型。

程序代码：

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = ;
int a[MAXN], use[MAXN];
long long  low_bound, high_bound;
int n, m;
void init()
{
    low_bound = -;
    high_bound = ;
    memset(use, , sizeof(use));
}

int solve(int mid)
{
    int sum = , group = ;
    for(int i = n-; i >= ; i--)
    {
        if(sum + a[i] > mid)
        {
            sum = a[i];
            group++;
            if(group > m) return ;
        }
        else sum += a[i];
    }
    return ;
}

void print(int high_bound)
{
    int group = , sum = ;
    for(int i = n-; i >= ; i--)
    {
        if(sum + a[i] > high_bound)
        {
            use[i] = ;
            sum = a[i];
            group++;
        }
        else sum += a[i];
        if(m-group == i+)
        {
            for(int j = ; j <= i; j++)
                use[j] = ;
            break;
        }
    }
    for(int z = ; z< n-; z++)
    {
        printf("%d ", a[z]);
        if(use[z]) printf("/ ");
    }
    printf("%d\n", a[n-]);
}

int main()
{
    int T;
    scanf("%d%*c", &T);
    while(T--)
    {
        init();
        scanf("%d%d", &n, &m);
        for(int i = ; i < n; i++)
        {
            scanf("%d", &a[i]);
            if(low_bound < a[i]) low_bound = a[i];
            high_bound += a[i];
        }
        long long x = low_bound, y = high_bound;
        while(x <= y)
        {
            long long  mid = x+(y-x)/;
            if(solve(mid)) y = mid-;
            else x = mid+;
        }
        print(x);
    }
    return ;
}