#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> arr={5,1,1,0,2}; //To find total number of subarrays- n*(n+1)/2
int n=arr.size();
int count=0, sum=0;
int k=4;
/* brute force approach may be have O(N2)
we can perform operation (like sum) on each subarray using O(n2) but we cannot print the all
subarray using just O(n2)
*/
for(int i=0;i<5;i++){
int sum=0;
for(int j=i;j<5;j++){
sum+=arr[j];
if(sum==j-i+1){
count++;
}
}
}
cout<<count;
// unordered_map<int ,int> ok;
// int count=0 ,sum=0;
// for(int i=0;i<arr.size();i++){
// sum+=arr[i];
// if(ok.find(sum-i)!=ok.end()){
// count+=ok[sum-i];
// }
// ok[sum-i]++;
// }
// cout<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCXZlY3RvcjxpbnQ+IGFycj17NSwxLDEsMCwyfTsgICAvL1RvIGZpbmQgdG90YWwgbnVtYmVyIG9mIHN1YmFycmF5cy0gbioobisxKS8yIAoJaW50IG49YXJyLnNpemUoKTsKCWludCBjb3VudD0wLCBzdW09MDsKCWludCBrPTQ7CgkvKiAgYnJ1dGUgZm9yY2UgYXBwcm9hY2ggbWF5IGJlIGhhdmUgTyhOMikgIAoJd2UgY2FuIHBlcmZvcm0gb3BlcmF0aW9uIChsaWtlIHN1bSkgb24gZWFjaCBzdWJhcnJheSB1c2luZyBPKG4yKSBidXQgd2UgY2Fubm90IHByaW50IHRoZSBhbGwKCXN1YmFycmF5IHVzaW5nIGp1c3QgTyhuMikKCSovIAoJZm9yKGludCBpPTA7aTw1O2krKyl7CgkJCWludCBzdW09MDsKCQlmb3IoaW50IGo9aTtqPDU7aisrKXsKCQkJc3VtKz1hcnJbal07CgkJCWlmKHN1bT09ai1pKzEpewoJCQkJY291bnQrKzsKCQkJfQoJCQkKCQl9CgkJCgl9Cgljb3V0PDxjb3VudDsKCS8vIHVub3JkZXJlZF9tYXA8aW50ICxpbnQ+IG9rOwoJLy8gaW50IGNvdW50PTAgLHN1bT0wOwoJLy8gZm9yKGludCBpPTA7aTxhcnIuc2l6ZSgpO2krKyl7CgkvLyAJc3VtKz1hcnJbaV07CgkvLyAJaWYob2suZmluZChzdW0taSkhPW9rLmVuZCgpKXsKCS8vIAkJY291bnQrPW9rW3N1bS1pXTsKCS8vIAl9CgkvLyAJb2tbc3VtLWldKys7CgkvLyB9CgkvLyBjb3V0PDxjb3VudDsKCXJldHVybiAwOwp9