POJ 3273 Monthly Expense

最新推荐文章于 2023-09-01 22:00:12 发布

Unin88

最新推荐文章于 2023-09-01 22:00:12 发布

阅读量326

点赞数

分类专栏：二分查找文章标签：二分查找

本文链接：https://blog.csdn.net/Unin88/article/details/39337347

版权

二分查找专栏收录该内容

15 篇文章 0 订阅

订阅专栏

http://poj.org/problem?id=3273

将数列中的元素分组使得分组后和的最大值最小采用二分答案的方法穷举。

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

int N,M,a[100010],ans;

bool check(int mid){
    int sum = 0,cnt = 1;
    for(int i=1; i<=N; i++){
        if(sum + a[i] <= mid)
            sum += a[i];
        else{
            sum = a[i];
            cnt++;
        }
    }
    return cnt <= M;
}

int main(){
//    freopen("in.txt", "r", stdin);
    scanf("%d%d",&N,&M);
    int sum = 0,left = 0, right;
    for(int i=1; i<=N; i++){
        scanf("%d",&a[i]);
        sum += a[i];
        left = max(left, a[i]);
    }
    right = sum;
    while(left <= right){
        int mid = (left + right) >> 1;
        if(check(mid)){
            ans = mid;
            right = mid - 1;
        }
        else
            left = mid + 1;
    }
    printf("%d\n",ans);
}