luoguP4343自动刷题机

https://www.luogu.org/problem/P4343

又是一题二分答案.....自主思考吧....不熟悉的可以选择看看我之前写的二分博文，当然也可以在网上找一些....
（主要原因是作者要写luogu里的考试题....又一次菜掉了....

标题就是注意事项，这里的二分求最大最小值中，ans的取值位置是不一样的...
int ： 好好好，都是我的错emm.....

#include<cstdio>
#include<algorithm>
using namespace std;
#define MAX 100000+9
#define INF 0x7f7f7f7f7f7f7f
#define ll long long

ll L, k;
ll a[MAX];

long long MAXmax(long long a,long long b)
{
  if(a>b)return a;else return b;
}
ll check(ll n) {
    ll sum = 0, num = 0;
    for(int i = 1; i <= L; i++) {
        sum += a[i];
        if(sum >= n) {
            num++;
            sum = 0;
        } 
        sum = MAXmax(sum, 0);//有可能删成负数了 
    }
    return num;
}

int main() {
    scanf("%lld%lld",&L, &k);
    for(int i = 1; i <= L; i++) scanf("%lld",&a[i]);
    ll l = 1, r = INF, ansmin = -1, mid, num;
    while(l <= r) {
        mid = (l+r)>>1;
        num = check(mid);
        if(num <= k) {
            r = mid-1;
            if(num == k) ansmin = mid;
        } else{
            l = mid+1;
        }
    }
    l = 1, r = INF;
    ll ansmax = -1;
    while(l <= r) {
        mid = (l+r)>>1;
        num = check(mid);
        if(num < k) {
            r = mid-1;
        } else {
            if(num == k) ansmax = mid;
            l = mid+1;
        }
    }
    if(ansmin == -1) {
        printf("-1");
        return 0;
    }
    printf("%lld %lld",ansmin, ansmax);
}

转载于:https://www.cnblogs.com/tyner/p/11289044.html