I would like to know if we can solve [problem:1023D] like this....↵
↵
change any zero to a non zero value just to its left (or right, doesn't matter), check for occurrence of value "q" in the array, keep track of li and ri as index of first and last appearance of i in array for all possible i given in array and then for every "i" in the array check if there is a value less than i (let that be j) in the array in index range [li, ri] . If such a value exists then we can say that such an array cant occur because query with j < i will always happen after jth query so there can be complete overlap or partial of ith query over jth query and not vice-versa....↵
↵
I think this a sufficient condition for the solution butiI m not able to get ans.... (solution link : [submission:42340677])↵
↵
I would to like to know for some flaw in the solution or counter example for the same (explaining the flaw)↵
↵
Thanks in advance!!!
↵
change any zero to a non zero value just to its left (or right, doesn't matter), check for occurrence of value "q" in the array, keep track of li and ri as index of first and last appearance of i in array for all possible i given in array and then for every "i" in the array check if there is a value less than i (let that be j) in the array in index range [li, ri] . If such a value exists then we can say that such an array cant occur because query with j < i will always happen after jth query so there can be complete overlap or partial of ith query over jth query and not vice-versa....↵
↵
I think this a sufficient condition for the solution but
↵
I would to like to know for some flaw in the solution or counter example for the same (explaining the flaw)↵
↵
Thanks in advance!!!
