Subarray Sum

#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define pb push_back
const lli mod=1e9+7;
const int K=3;


int subArraySum(int arr[], int n, int sum)
{
    int curr_sum, i, j;
 
    // Pick a starting point
    for (i = 0; i < n; i++) {
        curr_sum = arr[i];
 
        // try all subarrays starting with 'i'
        for (j = i + 1; j <= n; j++) {
            if (curr_sum == sum) {
                cout << "Sum found between indexes "
                     << i << " and " << j - 1;
                return 1;
            }
            if (curr_sum > sum || j == n)
                break;
            curr_sum = curr_sum + arr[j];
        }
    }
 
    cout << "No subarray found";
    return 0;
}

int main()
{

	// #ifndef ONLINE_JUDGE
 //    freopen("input.txt", "r" ,stdin);
 //    freopen("output.txt","w" ,stdout);
 //    #endif



      lli n;
       cin>> n;
     int arr[n];
       for (int i = 0; i < n; ++i)
       {
         cin >>arr[i];
       }
       lli sum=0;;
       for (int i = 0; i < n; ++i)
       {
        sum+=arr[i];
       }

       subArraySum(arr,n,sum);
   
       
    

    
  







     
   
    






  






return 0;
}