More problems.
This commit is contained in:
@@ -47,6 +47,10 @@ A little collection of interesting problems that I randomly decided to do.
|
||||
|
||||
Interesting reroot problem, there's not much for me to say about it.
|
||||
|
||||
- [F. Gardening Friends](https://codeforces.com/problemset/problem/1822/F)
|
||||
|
||||
Very standard reroot problem, but interesting as an exercise.
|
||||
|
||||
## DP
|
||||
|
||||
- [D. World is Mine](https://codeforces.com/problemset/problem/1987/D)
|
||||
@@ -133,6 +137,10 @@ A little collection of interesting problems that I randomly decided to do.
|
||||
it's interesting to think about regardless, can also be solved with a binary search, but
|
||||
it's not required.
|
||||
|
||||
- [F. Expected Median](https://codeforces.com/problemset/problem/1999/F)
|
||||
|
||||
Kinda introductory combinatory problem, but interesting as an exercise.
|
||||
|
||||
## DSU
|
||||
|
||||
- [https://codeforces.com/problemset/problem/1985/H1](https://codeforces.com/problemset/problem/1985/H1)
|
||||
@@ -151,3 +159,9 @@ A little collection of interesting problems that I randomly decided to do.
|
||||
|
||||
Interesting problem to think about, good introduction to divide and conquer in my opinion and
|
||||
can be used as a bridge to segment trees.
|
||||
|
||||
## String
|
||||
|
||||
- [G1. Division + LCP (easy version)](https://codeforces.com/problemset/problem/1968/G1)
|
||||
|
||||
Can be solved in a lot of ways, but I find hashing with binary search simpler.
|
||||
|
||||
Reference in New Issue
Block a user