100872571

There are some minor mistakes that i have fixed,i have also put some comments overthere,hope it helps

the person below me is gay

i just Bruteforce it,there are 2 possibilities,whether the string S become 101010... or 010101... here is my code 96881167

96844907

no,according to image, 1 3 2 and 2 3 1 will make the BinarySearch function return false,for example 1 3 2

left=0,right=3,then middle=1,we check a[middle] is 3,then left=middle+1=2.Then middle=2,we check a[middle]=2 which 2<=3 then left=middle+1=3,then it will exit the while loop because left=right.After that we look at a[left],is a[left]=3?no because left=1,then BinarySearch function will return false as the result

During the contest, we are only given a few presests so that the queue during the contest is not long. After the contest, another test case will be given for participant submissions, this test case is called a system test

thanks dude,but i still dun get the idea of the problem C,can u explain more??

can someone explain to me whats wrong with my algorithm 96738918 in D2C? i know my idea is wrong,but im confused whats wrong with it