1 Kicks

How to Solve the Ski-Shop Problem using Dynamic Programming(danielahill.com)

submitted by resabioresabio(95) 2 years, 6 months ago

There exists a ski shop that owns m skies and N skiers have registered to rent skis for the day. We know the height of all N skiers and we know the ski length of each of the skis. The goal is to match each skier with a pair of skis so that the total difference between each skier and the length of his/her skis is minimized.

add a comment |category: |Views: 12

tags: another

new Add a live kick counter to your blog >> liveImage

You can even customize the image by choosing your own colors, and then clicking the button below to update the preview and the html code:

  • "Kick It" text
  • "Kick It" background
  • kick count text
  • kick count background
  • border

Simply copy and paste this HTML into your blog post.


Users who kicked this story:
resabioresabio(95)
Comments:

No comments so far

information Login or create an account to comment on this story
Submit a Story
View upcoming stories
How else can I help?
Add our feeds to your site

Most Active Users

What's this?