Maximum sum query segmentation fault

what is wrong in my code i am using segment tree approach
link: https://ide.codingblocks.com/s/259440

@S19CCPP0005
Changing line 24 to int mid=(ss+se)/2; will remove runtime error but your code code is giving wrong answer now. Use long long int and check your final logic.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.