contest_2012-09-06
This is an old revision of the document!
Problems for the Week
- 11849 CD (efficient data structure important; also use BufferedReader in Java)
- 10954 Add All (dequeue the two smallest addends)
- 11995 I Can Guess the Data Structure! (good practice simulating three common data structures: stack, queue, priority queue)
- 11926 Multitasking (Halim says use a Fenwick Tree)
- 11235 Frequent Values (use Segment Tree with careful mapping to compute Range Maximum Query, good luck)
- 11402 Ahoy, Pirates! (modify Segment Tree to support updates, double good luck)
Contest page: here.
contest_2012-09-06.1346895131.txt.gz · Last modified: 2012/09/05 18:32 by jtkorb