#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {10,5,2,7,1,9};
int n=sizeof(arr)/sizeof(arr[0]);
int k=15;
int largest=INT_MIN, smallest=INT_MAX;
for(int i=0;i<n;i++){
int currSum=0;
for(int j=i;j>=0;j--){
currSum+=arr[j];
if(currSum==k){
largest=max(largest,i-j+1);
smallest=min(smallest, i-j+1);
}
}
}
cout<<largest<<" "<<smallest;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezEwLDUsMiw3LDEsOX07CglpbnQgbj1zaXplb2YoYXJyKS9zaXplb2YoYXJyWzBdKTsKCWludCBrPTE1OwoJaW50IGxhcmdlc3Q9SU5UX01JTiwgc21hbGxlc3Q9SU5UX01BWDsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWludCBjdXJyU3VtPTA7CgkJZm9yKGludCBqPWk7aj49MDtqLS0pewoJCQljdXJyU3VtKz1hcnJbal07CQoJCQlpZihjdXJyU3VtPT1rKXsKCQkJCWxhcmdlc3Q9bWF4KGxhcmdlc3QsaS1qKzEpOwoJCQkJc21hbGxlc3Q9bWluKHNtYWxsZXN0LCBpLWorMSk7CgkJCX0KCQl9Cgl9Cgljb3V0PDxsYXJnZXN0PDwiICI8PHNtYWxsZXN0OwoJcmV0dXJuIDA7Cn0K