Initial commit

Author: Sridhar Venkat

README.md

@@ -0,0 +1 @@
+# subarraysum

input1.txt

@@ -0,0 +1,8 @@
+3
+74 665
+142 112 54 69 148 45 63 158 38 60 124 142 130 179 117 36 191 43 89 107 41 143 65 49 47 6 91 130 171 151 7 102 194 149 30 24 85 155 157 41 167 177 132 109 145 40 27 124 138 139 119 83 130 142 34 116 40 59 105 131 178 107 74 187 22 146 125 73 71 30 178 174 98 113
+5 12
+1 2 3 7 5
+10 15
+1 2 3 4 5 6 7 8 9 10
+

subarray.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    int t;
+    cin >> t;
+    bool foundanswer = false;
+
+    while(t--) {
+        int n, s;
+        cin >> n >> s;
+        //cout << "N and S are " << n << " " << s << endl;
+
+        int sum = 0;
+        int startindex = 0;
+        vector<int> values;
+      
+        for (int i=0; i < n; i++) {
+           int temp;
+           cin >> temp;
+           values.push_back(temp);
+        }
+
+        for(int i=startindex; i < n; i++) {
+           sum = sum + values[i];
+           //cout << "Value : " << values[i] << endl;
+
+           if (sum > s) {
+               startindex++;
+               //cout << "Resetting... " << sum << endl;
+               i = startindex - 1;
+               sum = 0;
+           }
+
+           if (sum == s) {
+               //cout << "Found." << endl;
+               //for(int j=startindex; j<=i; j++) {
+               //    cout << values[j] << " ";
+               //}
+               cout << startindex+1 << " " << i+1 << endl;
+               foundanswer = true;
+               break;
+           }
+
+        } 
+        if (foundanswer == false) {
+            cout << -1 << endl;
+        }
+    }
+    return 0;
+}