–> Rozvrh denně dopoledne 9.00 - 11.45, odpoledne 12.30 - 14.30, 14.45 - 16.00.
. Úpravy možné po dohodě s lektorem.
–> Učebna KN:E-327, budova E v areálu FEL ČVUT na Karlově náměstí.
Segmentové stromy.
https://www.spoj.com/problems/RPLN/ http://codeforces.com/contest/597/problem/C http://codeforces.com/gym/101908/problem/C https://www.spoj.com/problems/HORRIBLE/ https://www.spoj.com/problems/ADATREE/ https://www.spoj.com/problems/ADABERRY/
Fourierova transformace, FFT, DFT, násobení polynomů.
https://codeforces.com/contest/472/problem/G https://www.spoj.com/problems/POLYMUL/ https://www.spoj.com/problems/MAXMATCH/ https://www.spoj.com/problems/ADAMATCH/ https://codeforces.com/problemset/problem/954/I https://codeforces.com/problemset/problem/958/F3 https://open.kattis.com/problems/kinversions https://codeforces.com/contest/754/problem/E
materiály: https://cp-algorithms.com/algebra/fft.html#toc-tgt-14
LCA (= Lowest Common Ancestor) ve stromech, Heavy-light decomposition.
http://www.spoj.com/problems/LCASQ/ http://www.spoj.com/problems/QTREE2/ https://www.spoj.com/problems/NTICKETS/ https://www.spoj.com/problems/ADAVISIT/ https://www.spoj.com/problems/ADAORANG/ http://codeforces.com/gym/101908/problem/L https://www.spoj.com/problems/DRTREE/
Přibližná řešení NP-úplných úloh
https://www.spoj.com/problems/TAKIN/ https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1885 https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=766&page=show_problem&problem=5638 https://www.spoj.com/problems/ADAPARTY/ http://codeforces.com/gym/101908/problem/J http://www.spoj.com/problems/ADACROW https://www.spoj.com/problems/ADAPARTI/ http://codeforces.com/contest/907/problem/E http://codeforces.com/contest/839/problem/E
Huffmanovo kódování
Strojové učení