LeetCode 2398. 预算内的最多机器人数目

添加链接描述

二分 + RMQ

const int N = 5e4 + 10, M = 20;
typedef long long LL;
class Solution {
public:
    vector<int> x, y;
    LL m;
    int log[N] = {0};
    LL sum[N] = {0};
    int f[N][M];
    void init()
    {
        log[1] = 0;
        for(int i = 2; i < N; i ++) log[i] = log[i >> 1] + 1;

        for(int j = 0; j < M; j ++)
            for(int i = 0; i + (1 << j) - 1 < x.size(); i ++)
            {
                if(!j) f[i][j] = x[i];
                else f[i][j] = max(f[i][j - 1], f[i + (1 << j - 1)][j - 1]);
            }
        for(int i = 0; i < y.size(); i ++)
            sum[i + 1] = sum[i] + y[i];
    }
    int query(int l, int r)
    {
        int k = log[r - l + 1];
        return max(f[l][k], f[r - (1 << k) + 1][k]);
    }
    bool check(int k)
    {
        for(int i = 0, j = k - 1; j < x.size(); i ++, j ++)
        {
            if(query(i, j) + k * (sum[j + 1] - sum[i]) <= m)
                return true;
        }
        return false;
    }
    int maximumRobots(vector<int>& chargeTimes, vector<int>& runningCosts, long long budget) {
        x = chargeTimes, y = runningCosts, m = budget;
        init();
        int n = x.size();
        int l = 0, r = n;
        while(l < r)
        {
            int mid = (l + r + 1) >> 1;
            if(check(mid)) l = mid;
            else r = mid - 1;
        }
        return r;
    }
};

单调队列

typedef long long LL;
class Solution {
public:
    int maximumRobots(vector<int>& chargeTimes, vector<int>& runningCosts, long long budget) {
        int n = chargeTimes.size();

        deque<int> q; // 单调递减的队列
        int res = 0;
        LL sum = 0;

        for(int l = 0, r = 0; r < n; r ++)
        {
            sum += runningCosts[r];
            while(!q.empty() && chargeTimes[q.back()] <= chargeTimes[r])
                q.pop_back();
            
            q.push_back(r);

            while(!q.empty() && chargeTimes[q.front()] + (r - l + 1) * sum > budget)
            {
                sum -= runningCosts[l];
                if(q.front() == l) q.pop_front();
                l ++;
            }
            res = max(res, r - l + 1);
        }
        return res;
    }
};