I don't understand how this new logo goes with .
Previous one was much relatable and nice. I wish this change to be temporary.
I sorted array a increasingly ans b decreasingly . Then for every element in array b , I searched the lower bound in array a .
My code is pretty simple to understand.
An array of n elements is given. In this array, How many intervals [l,r] contain at least two 2 ? How many intervals [l,r] contain at least one 4? How many intervals contain two 2 and one 4 together? Note that, [1,1],[2,2] these intervals are also valid. Each of them contains 1 element.
Size of n is 1e5.
Problem Link I have come up with a nice idea . I will just use three vectors to keep the negative numbers(v1),zeros(v2),positive numbers(v3).
Let the size of the vectors v1,v2,v3.
Then there will be (v1* v3) negative products , ((v1*v2 + (v3*v2)) zeros , ( (v1*(v1-1))/2 + (v3*(v3-1))/2) positive products.
So I can easily know whether Kth number will be negative or zero or positive.
But I am failing to print the answer when It is a positive number. I don't know how to find the positive product which is in this -- >( (v1*(v1-1))/2 + (v3*(v3-1))/2) count.