Data Structure Array: Find if there is a subarray with 0 sum

http://www.geeksforgeeks.org/find-if-there-is-a-subarray-with-0-sum/

 #include <iostream>
 #include <vector>
 #include <algorithm>
 #include <queue>
 #include <stack>
 #include <string>
 #include <fstream>
 #include <map>
 #include <set>
 using namespace std;

 bool zerosubarray(int arr[], int n) {
     set<int> S;
     int sum = ;
     for (int i = ; i < n; i++) {
         sum += arr[i];
         if (arr[i] ==  || sum ==  || S.find(sum) != S.end()) return true;
         S.insert(sum);
     }
     return false;
 }

 int main() {
     int arr[] = {, , -, , };
     if (zerosubarray(arr, )) cout << "yes" << endl;
     else cout << "no" << endl;
     return ;
 }