obsolete's blog

Codeforces tutorials
By obsolete, 10 years ago, In English

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.

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

Comments Comments (12)
| Write comment?
»
10 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

BIT

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Z Algorithm

→ Reply
»
9 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

Blog Entry for list of Tutorials: http://codeforces.com/blog/entry/13529

→ Reply
»
7 years ago, # |
  Vote: I like it -24 Vote: I do not like it

How to change problemset language to mongolia and add mongolian flag??? please help me???

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

    The only languages on this site are English and Russian...sorry.

    → Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Does this count ???

→ Reply
»
7 years ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

Two great resources:

An awesome list for competitive programming!
Good Blog Post Resources about Algorithm and Data Structures

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

Parallel Binary Search

Divisors in O(N^(1/3))

SOS DP

DSU on tree

Mo's algorithm on tree

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +10 Vote: I do not like it

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

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Also , i request anybody to upload a link of a good tutorial that explains dynamic programming using bitmasking in detail . Thanx.

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

      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.

      → Reply