This week will feature two episodes. Episode 7 will cover Steiner Trees. Episode 8 (previously Episode 7) will feature Makoto Soejima (rng_58). This will make up last week's episode that was cancelled due to technical difficulties.
You can find more info here: http://algorithms-live.blogspot.com/2017/02/episodes-7-and-8-steiner-trees-and.html
Update: Episode 8 will be starting soon. Sorry for the delay and confusion! Here is the link: https://www.youtube.com/watch?v=UrgYcfIT42M
This week’s episode will feature a special guest, Makoto Soejima (rng_58). If you have any questions for Makoto that you are interested in having answered on the show, please leave a comment with the question. To accommodate the time zone difference, the episode will take place at a special time.
Update: We decided to move the live episode an hour earlier to prevent the conflict with CS Academy Round #18.
Update: We are very sorry about having to reschedule the episode. You can read more details about the technical problems we were having here: http://algorithms-live.blogspot.com/2017/02/technical-difficulties-with-episode-7.html
We hope to see many of you next week for the rescheduled episode!
This week will be talk show format and will feature our first guest, Deon Nicholas (dojiboy9).
More info can be found here: http://algorithms-live.blogspot.com/2017/01/episode-2-fancy-antiques.html
Edit: For those interested in implementations of the discussed solutions, those can be found on David Van Brackle's judging blog: http://serjudging.vanb.org/?p=924.
In honor of Donald Knuth's lecture series on trees, this week's episode of Algorithms Live! will cover trees. More information can be found here: http://algorithms-live.blogspot.com/2016/12/episode-1-trees-and-diameters.html
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!
Apparently these problems were also used in Open Cup. If anyone is interested the solutions were finally posted. http://serjudging.vanb.org/?cat=22
I decided to post here in case it wasn't announced to people who competed in the Open Cup version. =)