Hello coders,
I was preparing for the regional finals and came across a question which asks to find the number of ways in which a circular array can be divided into two parts such that sum of elements in both parts is equal.
So this has to do something with cumulative sum in an array.One of the participants wrote the following code(presenting the snippet only)
total=sum of all elements/2
if total%2==1 return 0
for(i=0 to n-1)
{
sum+=a[i]
ans+=cnt[sum]
cnt[sum+total]++
}
print ans
I want to know what is the logic behind this...Also if some one has links/or has some more questions involving cumulative sum of circular arrays please post it(I guess this is author's favourite topic)..Thanks in advance
I was preparing for the regional finals and came across a question which asks to find the number of ways in which a circular array can be divided into two parts such that sum of elements in both parts is equal.
So this has to do something with cumulative sum in an array.One of the participants wrote the following code(presenting the snippet only)
total=sum of all elements/2
if total%2==1 return 0
for(i=0 to n-1)
{
sum+=a[i]
ans+=cnt[sum]
cnt[sum+total]++
}
print ans
I want to know what is the logic behind this...Also if some one has links/or has some more questions involving cumulative sum of circular arrays please post it(I guess this is author's favourite topic)..Thanks in advance
Комментарии (3)
0
