Help with approach

#1

prob: https://codeforces.com/problemset/problem/1466/B

sol: https://ide.codingblocks.com/s/402898

#2

hello @raghav007
increase ur array size (check constraints).

#3

done still, not working

#4

@raghav007
image
u r reading n+1 elements in total .

use i<n .

#5

last example test case is failing ans shd be 3 it is giving 4

#6

check now->

if previous < current then cnt++

else if previous ==current then we need to increase current by 1 and then cnt++

also update previous max in both the case

#7

can you please explain the concept for the algorithm I’m not able to understand.

#8

see given array is sorted.
so x[i]<=x[i+1] will always hold.

we can break this condition in x[i] == x[i+1] and x[i] < x[i+1] and then solve them seprately.

case x[i]< x[i+1] clealry we include x[i+1] so cnt++

case x[i]==x[i+1] here we need to increase x[i+1] by 1 to make x[i] < x[i+1] and then cnt++;