I have solved the problem KGSS-Maximum Sum from SPOJ using segment tree in Java and I am getting TLE. Can anyone help me to further optimize my code?
Problem link: SPOJ.com - Problem KGSS
Solution link: IDE | GeeksforGeeks | A computer science portal for geeks
@curio please help me in this pronlem