Spoj gss1 getting wrong answer

help
1

Hello,
I need help with spoj problem gss1.

I am getting WA from the test case 9;
given below is my code:

#include<bits/stdc++.h>
using namespace std;

void constructTree(int input[], int segTree[], int low, int high, int pos) {
	if (low == high) {
		segTree[pos] = input[low];
		return;
	}
	int mid = (low + high) / 2;
	constructTree(input, segTree, low, mid, 2 * pos + 1);
	constructTree(input, segTree, mid + 1, high, 2 * pos + 2);
	int temp1 = min(segTree[2 * pos + 1], segTree[2 * pos + 2]);
	int temp2 = max(segTree[2 * pos + 1], segTree[2 * pos + 2]);
	if(temp1 < 0) {
		segTree[pos] = temp2;
	} else {
		segTree[pos] = (segTree[2 * pos + 1] + segTree[2 * pos + 2]);
	}
}

int rangeMaxSum(int segTree[], int qlow, int qhigh, int low, int high, int pos) {
	if(qlow <= low && qhigh >= high) {
		return segTree[pos];
	}
	if (qlow > high || qhigh < low) {
		return 0;
	}
	int mid = (low + high) / 2;
	return rangeMaxSum(segTree, qlow, qhigh, low, mid, 2 * pos + 1) + rangeMaxSum(segTree, qlow, qhigh, mid + 1, high, 2 * pos + 2);
}

int main() {
	int n, m;
	cin >> n;
	int arr[n];
	for(int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	cin >> m;
	int x, y;
	int segTree[4 * n] = {0};
	constructTree(arr, segTree, 0, n - 1, 0);
	// for(int i = 0; i < n * 2; i++) {
	// 	cout << segTree[i] << " ";
	// }
	// cout << endl;
	for(int i = 0; i < m; i++) {
		cin >> x >> y;
		int ans = rangeMaxSum(segTree, x - 1, y - 1, 0, n - 1, 0);
		cout << ans << endl;
	}
}
2

I modified the rangeMaxSum() function as follows:
but still getting wrong.

int rangeMaxSum(int segTree[], int qlow, int qhigh,     int low, int high, int pos) {
    	if(qlow <= low && qhigh >= high) {
    		return segTree[pos];
    	}
    	if (qlow > high || qhigh < low) {
    		return 0;
    	}
    	int mid = (low + high) / 2;
    	int temp1 = rangeMaxSum(segTree, qlow, qhigh, low, mid, 2 * pos + 1);
    	int temp2 = rangeMaxSum(segTree, qlow, qhigh, mid + 1, high, 2 * pos + 2);
    	if(min(temp1, temp2) < 0){
    		return max(temp1, temp2);
    	} else {
    		return temp1 + temp2;
    	}
    }