I tried to solve this problem but could not do it better than O(n^2).

`My Algorithm: 1.calculate prefixsum 2.for i 1...n for j 1...i if(presum[i]-presum[j-1]>k) ans=max(ans,i-j); `

**However, this is inefficient for large values of n.Can someone help me with optimized algorithm along with code preferably in c++.**