Has it been announced? If not, what is the probable date?

Suppose an array contains n elements. The elements is in the range 10⁹. We want to know, for every element in the array, the position of the leftmost element that is smaller than that one.

An example:

The array: 20 3 10 5 1 9 100

Answer: 0 0 2 2 0 2 1

Can this problem be done in O(n)?

Is there any problem or type of problem that can be solved by Suffix Automaton but can't be solved with Suffix Array?

why am i getting wrong answer on test 22? this is my code.

PROBLEM

I've solved this problem using sqrt decomposition. but how can i solve it using segment tree?

Thanks in advance :)

can anyone explain the hashing solution of this problem?

thanks in advance :)

guys its my birthday :) whoever wishes me gets a piece of hypothetical cake :p

If u upvote this post and your team is within first four places in ICPC WF, u will get a gold medal :D don't miss the chance ;)

1. How do you choose teammates for any team contests like ICPC regional? What is your topmost priority when choosing a teammate?

2. During a team contest what is your strategy? Do you and your teammates divide problems among yourselves and solve individually or you try to solve one problem at a time but together?

3. Some suggestions about team training, like what type of problems do u solve when you are practising as a team?

Lots of experienced coders are here. It will be helpful for many of us who're new if u give some suggestions.

PS: I've participated in two local team contests and those memories are not very pleasant.