Really impressed by editorial writing style, he/she must be a cool teacher. Could not get E unfortunately :<

possible reason

np man, take your time.

d1 = j - i
n1 = a[j] - a[i]
d2 = i - k
n2 = a[i] - a[k]
if(d1 * n2 != d2 * n1)cnt++

this will remove division and get u ACed I hope, you can check my last submission.

really thank you for this website, I have become addicted to it, I hope that you will add Atcoder support as well in future :), doomo arigato !

Another thinking approach from editorial.I am too dumb so I was trying to find the optimal number to be changed at first by some pre-processing, but here the way, you find the lower bound of the moves and then you maximise the deleting operations was new to me.

Thank you for B, I learnt something new.

1 2 -1 4 5

Really,really thanks a lot man!

Yes I got it, thank you very much!

Hello, can you tell me how to create these mashups please? I did your Day 3 mashup, and now I want to make some daily A20J mashups,I am a n00b sorry.