# Difference between revisions of "Racing Gems"

### From charlesreid1

m (Replacing charlesreid1.com:3000 with git.charlesreid1.com) |
|||

Line 9: | Line 9: | ||

The location of gems are given by (x,y) integer pairs on the grid. Determine the maximum number of gems that can be obtained by the character. | The location of gems are given by (x,y) integer pairs on the grid. Determine the maximum number of gems that can be obtained by the character. | ||

− | Git repo has solution explanation: https://charlesreid1.com | + | Git repo has solution explanation: https://git.charlesreid1.com/cs/java/src/master/dynamic-programming/racing-gems |

=Flags= | =Flags= |

## Latest revision as of 03:50, 9 October 2019

# Problem Description

This problem is an ICPC programming competition problem.

In this problem, we have a race track of width x = 0 to x = w, height y = 0 to y = h. We have a character that begins at the x-axis (y=0) and moves toward the finish line (y=h) with a steady velocity v.

You control the character's horizontal velocity, -v/r to +v/r, and your goal is to obtain as many gems as possible.

The location of gems are given by (x,y) integer pairs on the grid. Determine the maximum number of gems that can be obtained by the character.

Git repo has solution explanation: https://git.charlesreid1.com/cs/java/src/master/dynamic-programming/racing-gems

# Flags

Combinatorics
Ordinary generating functions
Enumerating Permutations: String Permutations Generating Permutations: Cool
Longest Increasing Subsequence Cards (poker hands with a deck of 52 playing cards)
· Template:CombinatoricsFlag · e |

AlgorithmsSeries on Algorithms
Algorithms/Sort Three solid O(n log n) search algorithms: Merge Sort Algorithm Analysis/Merge Sort
Algorithms/Search
Algorithms/Combinatorics
Algorithms/Strings
Algorithm complexity Amortization Algorithm Analysis/Matrix Multiplication
Estimation
Project Euler
· Template:AlgorithmsFlag · e |