I am getting wrong answer with my code, Problem: Murthal Parantha

#1

Please have a look over my code!
Thanks in advance!

#2

@rkrishna
image
you have commented out the correct line…you have to take user input for the array

#3

https://ide.codingblocks.com/s/277876 Even then I am getting wrong answers as verdict

#4

@rkrishna can you explain the logic behind your ub ? I am assuming it is the upperbound value.
according to me the upperbound should be p(p+1)a[n-1] i am assuming here that a is sorted, so a[n-1] will hold the maximum value

#5

no! that is bad upper bound if a one uses smalest a[0] then it is better ub!
by the way I have rectified the issues it was with recursive call of function
thanks

#6

@rkrishna in that case, please mark your doubt as resolved

1 Like
#7

already done!

thanks

1 Like