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

Before contest

Codeforces Round #517 (Div. 1, based on Technocup 2019 Elimination Round 2)

03:06:35

Register now »

Codeforces Round #517 (Div. 1, based on Technocup 2019 Elimination Round 2)

03:06:35

Register now »

*has extra registration

Before contest

Codeforces Round #517 (Div. 2, based on Technocup 2019 Elimination Round 2)

03:06:35

Register now »

Codeforces Round #517 (Div. 2, based on Technocup 2019 Elimination Round 2)

03:06:35

Register now »

*has extra registration

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

1 | tourist | 3581 |

2 | OO0OOO00O0OOO0O0…O | 3264 |

3 | mnbvmar | 3246 |

4 | Um_nik | 3194 |

5 | LHiC | 3190 |

6 | Petr | 3161 |

7 | V--o_o--V | 3133 |

8 | CongLingDanPaiSh…5 | 3116 |

9 | ko_osaga | 3115 |

10 | Benq | 3098 |

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

1 | Radewoosh | 187 |

2 | Errichto | 165 |

3 | rng_58 | 161 |

4 | tourist | 158 |

5 | Vovuh | 150 |

5 | Um_nik | 150 |

7 | Petr | 149 |

7 | Swistakk | 149 |

9 | 300iq | 148 |

10 | PikMike | 147 |

10 | neal | 147 |

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: Oct/21/2018 07:58:25 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|