I find that there are many very good blog posts having tutorials on various data structures / algorithms. But they are spread out and there is no one way to find them all. So let's post as comments, the CF blog tutorials we have found interesting...
PS: I'm not talking about match "Editorials". I'm talking about articles like this and this for example
Thanks.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
BIT
Z Algorithm
Blog Entry for list of Tutorials: http://codeforces.me/blog/entry/13529
How to change problemset language to mongolia and add mongolian flag??? please help me???
The only languages on this site are English and Russian...sorry.
Does this count ???
Two great resources:
An awesome list for competitive programming!
Good Blog Post Resources about Algorithm and Data Structures
Thanks for this
Parallel Binary Search
Divisors in O(N^(1/3))
SOS DP
DSU on tree
Mo's algorithm on tree
0-1 bfs
All about segment trees
Data structures
Graph algorithms
Aho-Corassick algorithm
Palindromic tree
Efficient(iterative) segment trees
2D points and lines
Polygon algorithms
' Heavy light decomposition
Fast Fourier Transforms, part1
Fast Fourier Transforms, part2
Anti hash test
How to make unordered maps faster
Non trivial dp tricks
Also , i request anybody to upload a link of a good tutorial that explains dynamic programming using bitmasking in detail . Thanx.
For dp on bitmask, you just have one of the dimensions be 2^n, and for each transition, you update that bitmask with &. Ex. if you had bitmask state 10011, and you add item 3 to the set, then new bitmask is 11011, and you just update the dp.