Longest subarray with sum at most K

The question is:

Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K.

For example: A=[5,2,-1,0,3],K=1, the result is [2,-1,0]

I am inspired by Shortest Subarray with Sum at Least K. Is it possible to solve this corresponding problem with a monotonic queue? If True, how? If not, Why?

I have struggled with it for a long time. Hope for your help.