【非原创】ZOJ

题目：戳这里

题意：机器人走过一个花，可以给那个花浇水，给定步数下，问花的最小的最大能量值。

学习博客：戳这里

本人代码：

#include <bits/stdc++.h>
typedef long long ll;
const int maxn = 1e6+10;
const ll inf = 1e18;
using namespace std;
ll a[maxn];
ll b[maxn];
ll m, n;
int check(ll mid) {
    for(ll i = 1; i <= n+1ll; ++i) {
        b[i] = 0;
    }
    for(ll i = 1; i <= n; ++i) {
        ll temp = mid/a[i];
        if(mid%a[i]) ++temp;//所有的数必须大于等于mid
        if(i == n && b[i] >= temp) break;//当走到n，要考虑是不是还需要往下走了
        b[i]++;
        if(b[i] < temp) {
            b[i+1] += temp - b[i];
            b[i] = temp;
        }
    }
    ll cnt = 0;
    for(ll i = 1; i <= n+1ll; ++i) {
        cnt += b[i];
        if(cnt > m) return 0;
    }
    return 1;

}
int main(){
    int t;
    scanf("%d", &t);
    while(t--) {
        scanf("%lld %lld", &n, &m);
        for(ll i = 1; i <= n; ++i) {
            scanf("%lld", a+i);
        }
        ll l = 1, r = inf;
        ll ans = 0ll;
        while(l <= r) {
            ll mid = (l + r) / 2ll;
            if(check(mid)) l = mid + 1ll, ans = mid;
            else r = mid - 1ll;
        }
        printf("%lld
", ans);
    }

    return 0;
}