Subarray with given sum

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

/// Raihan Ruhin (username: raihanruhin) /// Resume: https://raihanruhin.github.io #include<bits/stdc++.h> using namespace std; #define SET(a) memset(a,-1,sizeof(a)) #define CLR(a) memset(a,0,sizeof(a)) #define PI acos(-1.0) #define MOD 1000000007 #define MX 100010 int main() { ios_base::sync_with_stdio(0), cin.tie(0); int tc, kk=1, n, x, arr[102], s; cin>>tc; while(tc--) { cin>>n>>s; int i; for(i=1;i<=n;i++) cin>>arr[i]; arr[0]=0; int st = 1, x=0; bool found = false; i=1; while(i<=n || x>s) { if(x>s) { x -= arr[st]; st++; i--; } else if(x<s) { x += arr[i]; } if(x==s) { found=true; break; } i++; } if(found) cout<<st<<" "<<i<<endl; else cout<<-1<<endl; //cout<<"Case "<<kk++<<": "<< <<"\n"; } return 0; }