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

# | User | Rating |
---|---|---|

1 | tourist | 3434 |

2 | fateice | 3337 |

3 | Um_nik | 3292 |

4 | OO0OOO00O0OOO0O0…O | 3280 |

5 | Syloviaely | 3274 |

6 | Petr | 3223 |

7 | Swistakk | 3105 |

8 | mnbvmar | 3096 |

9 | yosupo | 3091 |

10 | dotorya | 3081 |

# | User | Contrib. |
---|---|---|

1 | rng_58 | 163 |

2 | tourist | 160 |

3 | csacademy | 152 |

4 | Petr | 151 |

5 | Swistakk | 148 |

6 | Um_nik | 144 |

7 | Vovuh | 142 |

7 | Nickolas | 142 |

9 | BledDest | 138 |

9 | PikMike | 138 |

9 | matthew99 | 138 |

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

Suppose an array contains n elements. The elements is in the range 10^{9}. 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)?

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

**gold medal** :D don't miss the chance ;)

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

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?

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.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/23/2018 05:18:34 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|