tehqin's blog

By tehqin, history, 6 years ago, In English

Hello Codeforces! Some of you may be interested in a new live talk show on algorithms in competitive programming. Often I find, when competitive programmers get together, the discussions are interesting. Unless you are in a training group, these kinds of conversations only seem to happen at training camps or contests themselves. I believe a talk show will be another good place to capture such discussions.

I suppose I should introduce myself. Hello! My name is Matt Fontaine and I'm teaching faculty at the University of Central Florida. I've been involved in programming contests for many years but behind the scenes. For example I've helped judge the North American Invitational Programming Contest and been the cow artist for USACO. I love teaching algorithms and I hope that some of you will find my talk show useful.

The first broadcast will take place at 9pm tomorrow (December 23rd) in my timezone, but you can find the time in your timezone here. The first two broadcasts will be hosted at this time, but adjustments will be made based on interest and guest availability. :) The broadcast will take place here as a YouTube live stream and will be available for later viewing. The YouTube channel for the show is available here. I've also started a blog to help organize the show.

This week I will cover an elegant data structure popular in competitive programming, the Fenwick Tree (also known as a binary indexed tree or BIT). I believe this data structure is a good starting place given both its elegance and its commonplace in contests. If you want to understand how this data structure works, this episode is for you!

In future weeks I'll be covering a variety of topics. Sometimes I'll review a problem I find interesting or an algorithmic technique useful in contests. I hope to invite guests on future episodes to discuss techniques and problems they find interesting. Please suggest guests you would like to see on the show!

 
 
 
 
  • Vote: I like it
  • +124
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it +25 Vote: I do not like it

I think this could be a really great opportunity to learn and I'm looking forward to it!

»
6 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Auto comment: topic has been updated by tehqin (previous revision, new revision, compare).

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I think you should invite rpeng as a guest! I'm sure he would love helping you draw some more USACOws :).

  • »
    »
    6 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Yes. I've met Richard a few times and I think he would be a good guest. Thank you for the recommendation. He also does research in spectral graph theory. That might be an interesting topic for discussion as well.

»
6 years ago, # |
  Vote: I like it +9 Vote: I do not like it

I am eagerly waiting for it as this data structure was in my todo list. Thanks for making the task easier :)

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope to see some nice tricks and problems involving BIT :)

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

any pre-requisites ?

  • »
    »
    6 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This week, I'll be assuming some knowledge of Big-O notation when analyzing runtime. Different weeks will require different prerequisite knowledge. Given the diversity of background in the audience, the level of the technique or algorithm discussed will vary greatly. I'll attempt to include material for a variety of skill levels each week.

»
6 years ago, # |
  Vote: I like it +5 Vote: I do not like it

brilliant!

»
6 weeks ago, # |
  Vote: I like it -20 Vote: I do not like it

great oppurtunity to learn new things.

»
6 weeks ago, # |
  Vote: I like it -7 Vote: I do not like it

Nice initiative