#include <bits/stdc++.h>
using namespace std;
int longestSubarray(vector<int>& arr, int k){
int n = arr.size();
int length = 0;
for (int i = 0; i < n; i++){
int sum = 0;
for (int j = i; j < n; j++){
sum += arr[j];
if(sum <= k){
length = max(length, (j-i+1));
}
}
}
return length;
}
int main() {
// your code goes here
vector<int> arr = {8, 2, 4, 7, 1};
cout << longestSubarray(arr, 15);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbG9uZ2VzdFN1YmFycmF5KHZlY3RvcjxpbnQ+JiBhcnIsIGludCBrKXsKCWludCBuID0gYXJyLnNpemUoKTsKCWludCBsZW5ndGggPSAwOwoJCglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJaW50IHN1bSA9IDA7CgkJZm9yIChpbnQgaiA9IGk7IGogPCBuOyBqKyspewoJCQlzdW0gKz0gYXJyW2pdOwoJCQlpZihzdW0gPD0gayl7CgkJCQlsZW5ndGggPSBtYXgobGVuZ3RoLCAoai1pKzEpKTsKCQkJfQoJCX0KCX0KCQoJcmV0dXJuIGxlbmd0aDsKfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCgkKCXZlY3RvcjxpbnQ+IGFyciA9IHs4LCAyLCA0LCA3LCAxfTsKCWNvdXQgPDwgbG9uZ2VzdFN1YmFycmF5KGFyciwgMTUpOwoJcmV0dXJuIDA7Cn0=