时间208 ms
击败
39.83%
内存105.1 MB
击败
23.18%
class Solution {
public:
static constexpr int INF = 0x3f3f3f3f;
int shortestSubarray(const vector<int>& nums, int k) {
const int n = nums.size();
int ans = INF;
long long s = 0;
vector<pair<long long, int>> stk = {{0, -1}};
for (int i = 0;i < n;++i) {
s += nums[i];
int l = 0, r = stk.size();
while (l < r) {
const int mid = (l + r) / 2;
if (stk[mid].first + k <= s)
l = mid + 1;
else r = mid;
}
if (l > 0) ans = min(ans, i - stk[l - 1].second);
while (!stk.empty() && s <= stk.back().first)
stk.pop_back();
stk.emplace_back(s, i);
}
return ans < INF ? ans : -1;
}
};