problem So i know the solution is dp with 2 choices for index j in array for value i,closest left to j and closest right to j,but my query is if i don't choose optimally and instead choose m1= max value of (p+dp[i-1][p]) for p>j and m2=max value of (p-dp[i-1][p]) for p<j and then update dp[i][j]-max(m1,m2) will that also work?

kindly helpo in finding bug in my submission 282405113 for problem 1978D - Elections.i tried to run some test cases but am not able to find the failing test

kindly help in problem 1677A - Tokitsukaze и странное неравенство,i dont want to use data structure like fenwick tree.I tried to understand it from editorial but am unable to.

so my solution 262742856 had passes 8 pretests during live contest but after the contest was over,it gave run time error on test case 1.i changed my language to c++20 from c++17 and it got accepted,my question is why was it showing pretests passes during contest then?it is unfair to me.please see this Stefan2417 and alexchist