Balife from Greedy

#1

I am getting wrong answer.

#2 
        for(int i=0;i<n;i++)
        {
            diff+=(a[i]-load);//removed abs
            // diff=max(diff,-1*diff);removed this
            ans=max(ans,abs(diff));//added abs
        }
#3

I am still getting WA for the sample case

#4

@div_yanshu07

Its working fine https://ide.codingblocks.com/s/413411

#5

I have a doubt this is exactly similar to load balancer right??
Because we were following the same approach there also.
But, in that question we could divide our load between i+1 and i-1 at the same time but here it’s only allowed to divide our load between i+1 or i-1 at one time.

#6

Yeah …

#7

So, whenever I have to divide numbers equally in each cell. I’'ll use this approach?

#8

yup in most of the quest.

#9

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.