Introduction to Competitive programming
- 2. Most known competitions ACM ICPC Google code jam Facebook hacker cup
- 4. Problem types Why do we need to know what type of problem we are dealing with?
- 5. Problem type identification means you can : ✘ Pinpoint the problems Difficulty ✘Determine necessary time to solve the problem ✘Narrow the search for the right algorithm to use
- 6. So what are the main problem types ?
- 7. Group A : Group B : ad Hoc graph complete search mathematics divide and conquer string processing greedy computational geometry Dynamic programming some harder/rare problems problem types :
- 8. Problem types in a nutshell : Ad Hoc ✘ Can’t be classified anywhere else. ✘ Usually the easisest one, ✘ Some examples: - games(cards, chess …) - anagrams - palindromes Complete search ✘ Brute force searching through the entire search space ✘ Beating the time limit ✘ Optimizing the search: (recursive backtracking) Divide and conquer ✘ Gaining in simplicity by dividing the problem to smaller parts ✘ Binary search example
- 9. Problem types in a nutshell : Greedy ✘ Case by case optimisation ✘ Optimal sub-structure ✘ Coin change example Dynamic programming ✘ Determine problem state ✘ Faster and more elaborate recursive backtracking ✘ A very small illustration(wedding shopping example)
- 10. To be continued …