OJ书本分发

最新推荐文章于 2024-09-30 07:31:33 发布

黑化后的亚瑟

最新推荐文章于 2024-09-30 07:31:33 发布

阅读量258

点赞数 1

分类专栏：算法 OJ 文章标签： c++

本文链接：https://blog.csdn.net/weixin_44025076/article/details/122052610

版权

算法同时被 2 个专栏收录

2 篇文章 0 订阅

订阅专栏

1 篇文章 0 订阅

订阅专栏

题目

Description

You are given N number of books. Every ith book has Pi number of pages. You have to allocate books to M number of students. There can be many ways or permutations to do so. In each permutation one of the M students will be allocated the maximum number of pages. Out of all these permutations, the task is to find that particular permutation in which the maximum number of pages allocated to a student is minimum of those in all the other permutations, and print this minimum value. Each book will be allocated to exactly one student. Each student has to be allocated at least one book.每一个学生只能分配连续出现的书本。

Input

The first line contains ‘T’ denoting the number of testcases. Then follows description of T testcases:Each case begins with a single positive integer N denoting the number of books.The second line contains N space separated positive integers denoting the pages of each book.And the third line contains another integer M, denoting the number of studentsConstraints:1<= T <=70，1<= N <=50，1<= A [ i ] <=250，1<= M <=50，Note: Return -1 if a valid assignment is not possible, and allotment should be in contiguous order (see explanation for better understanding)

Output

For each test case, output a single line containing minimum number of pages each student has to read for corresponding test case.

Sample Input 1

1
4
12 34 67 90
2

Sample Output 1

思路

把学生看成桶，问题就变成怎么把书分到桶里，保证每个桶里都得有书，并且这些桶中装的最多的那个桶是所有分配方案里最小的
我们可以枚举桶的大小，来模拟分配
其中桶的大小最大不会超过所有书的容量之和，但至少和最厚的那本书一样
这样，我们就可以用二分法来枚举,枚举操作的复杂度从O(N) 变成 O(LogN)
总的复杂度O(NlogN)

#include <iostream>
#include <vector>


using namespace std;


int get_bucket_cnt(vector<int>&pages,int bkSize){
    int currentBkSize = 0; //当前桶的大小
    int bucketCnt = 1;
    for(auto&e:pages){
        currentBkSize+=e;
        if(currentBkSize > bkSize)
        {
            bucketCnt++;
            currentBkSize = e;
        }
    }
    return bucketCnt;
}


int solution(vector<int>&pages,int stuCnt){
    if(stuCnt>pages.size())return -1;
    int l = pages[0],r=0;
    for(auto&e:pages){
        l = max(l,e);
        r+=e;
    }

    while (l<r){
        int mid = l+(r-l)/2;
        int bkCnt = get_bucket_cnt(pages,mid);
        if(bkCnt<=stuCnt){
            r =mid;
        }else l = mid+1;
    }
    return l;
}


void processCase()
{
    int n;
    cin>>n;
    vector<int> arr(n);
    for (int i = 0; i <n ; ++i) {
        cin>>arr[i];
    }
    int m;cin>>m;
    cout<<solution(arr,m)<<endl;
}

int main(){
    int caseNum;
    cin>>caseNum;
    while(caseNum-->0){
        processCase();
    }
}