LightOJ 1048 - Conquering Keokradong（二分逼近）

题目链接：http://lightoj.com/volume_showproblem.php?problem=1048

1048 - Conquering Keokradong

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

This winter we are going on a trip to Bandorban. The main target is to climb up to the top of Keokradong. So, we will use a trail. The trail is a continuous marked footpath that goes from Bandorban to Keokradong.

Part of the experience is also the route planning of the trip. We have a list of all possible campsites that we can use along the way and we want to do this trip so that we only stop K nights to camp. We also know in advance the distance between consecutive campsites and we are only allowed to camp at a campsite. Our goal is to plan the trip so that we minimize the maximum amount of walking done in a single day. In other words, if our trip involves 2 nights (3 days of walking), and we walk 9, 10, 5 miles on each day respectively, the cost (maximum amount of walking done in one day) is 10. Another schedule that involves walking 9, 6, 9 miles on each day has cost 9.

Given the distances between N consecutive campsites of a trail and given the number of nights for your trip, K, your task is to devise a camping strategy for the specified trail such that it minimizes the maximum amount of walking done in a single day. Note that the first distance value given is the distance from our start-point of the trail to our 1^st campsite, and the last distance value given is the distance from our N^th campsite to our end-point of the trail.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case contains of two integers, the number of campsites, N (1 ≤ N ≤ 1000) and the number of nights of the trip, K (1 ≤ K ≤ min(N, 300)). The following N + 1lines indicate the distance in miles between consecutive campsite locations. All the integers will be positive and less than 10000.

Output

For each case of input you have to print the case number and the minimized cost as described above. Then print K+1 lines, each containing the amount of distance covered in i^th day. As there can be many solutions, the primary target is to find the one which ensures that each day we have to walk some distance. For ties, print the one where the distance covered in first day is maximum, then the distance covered in second day is maximum and so on.

Sample Input	Output for Sample Input
1 4 3 7 2 6 4 5	Case 1: 8 7 8 4 5

 

---

PROBLEM SETTER: JANE ALAM JAN

Developed and Maintained by  JANE ALAM JAN

Copyright © 2012  LightOJ, Jane Alam Jan

题目大意：一家人去旅游，给出要走的路，在住宿天数k允许的范围内，求一天要走的最短距离，并输出每天要走的距离

题目解析：二分距离，注意输出，，，

特殊样例：

1
4 4
100 1 2 3 4

Case 1: 100
100
1
2
3
4
Process returned 0 (0x0)   execution time : 10.233 s
Press any key to continue.

代码如下：

#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#define N 1009
using namespace std;
const int inf = 1e9;
const int mod = 1<<30;
const double eps = 1e-8;
const double pi = acos(-1.0);
typedef long long LL;
int a[N];

int main()
{
    int cnt = 0, t, n, m, i, l, r;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d", &n, &m);
        l = r = 0; n++;
        for(i = 1; i <= n; i++)
        {
            scanf("%d", &a[i]);
            l = max(l, a[i]);
            r += a[i];
        }
        a[n + 1] = inf;
        int ans, md, now, k;
        while(l <= r)
        {
            md = (l + r) >> 1; now = k = 0;
            for(i = 1; i <= n; i++)
            {
                if(now + a[i] > md) now = a[i], k++;
                else now += a[i];
            }
            if(k <= m) r = md - 1, ans = md;
            else l = md + 1;
        }
        printf("Case %d: %d\n", ++cnt, ans);
        now = k = 0;
        for(i = 1; i <= n + 1; i++)
        {
            if(now + a[i] > ans || n - i < m - k)
            {
                k++;
                printf("%d\n", now);
                now = a[i];
            }
            else now += a[i];
        }
    }
    return 0;
}