Algorithms based on dynamic programming

Desktop Apps, Python — incorrectly specified categories?

3 USD

Client's review of cooperation with Daniil Muntyan

Algorithms based on dynamic programming

3 USD

I highly recommend, I did everything early and at a very high level.

5.0

Profile deleted

Reciprocal Feedback

4 July 2018

Freelancer's review of cooperation with client

Algorithms based on dynamic programming

3 USD

A very comprehensive, communicative and reliable customer. It explains the task quickly and clearly. It is easy to contact and solve questions. I was pleased with the cooperation. I highly recommend.

5.0

Daniil Muntyan

Reciprocal Feedback

4 July 2018

Project translated automatically. Log in or register, to view the original The chess board is set n on n fields.We will identify the field with a cortex (x, y), while: (1, 1) the field from the bottom to the left (n, 1) right to the bottom (n, n) to the top.Other fields on the lines are numbered.Let there be a figure that is in the lower line of the field (x, 1).The task is to bring the figure to the upper row, with the following limits: Leave the current position (x, u), then you can move the figure trace.form: - (x - 1, u + 1) - (x, u + 1) - (x + 1, u + 1) provided that the figure does not go beyond the board.Additionally, there is the function v: [n2] x [n2] R+, which shows two points p1 and p2 on the chess board on the actual value v(p1, p2).If the figure moves from p1 to p2 taking into account the above limitations, the value is v(p1, p2).Write an algorithm or pseudocode that, according to the principle of dynamic programming during the time of O(n2) the path from any field p1 on the lower line to any field pn of the upper line will reach with the maximum value of the sum v(pi, pi+1).The time of work of the algorithm.Let w(x, y) the maximum benefit that we can if we start from the field (x, y).First, create a recurrent principle of calculation for w(x, y).Examine from the fact that v(x, y) for time O(1) can be calculated.

Proposals 1

Daniil Muntyan

Winning proposal

5 1

Projects 4
Rating -
Rating 177

Budget: 150 UAH Deadline: 3 days

Hello, I can easily write the implementation of this algorithm, as I am a prizer of the programming Olympics, closely familiar with the theme of dynamic programming (one of my favorite themes).
What is the job? Writing an application on a pseudocode?
I will be able to do this in a short time and quality, with comments and explanations. We can talk about the price and nuances of the work.
The contacts:
by [email protected]
Posts by @daniil_muntyan
My profile on e-olymp: https://www.e-olymp.com/ru/users/muntyan

Current freelance projects in the category Desktop Apps

Need to transfer the site from Webflow to WordPress.

Web Programming 68 proposals 3 August

Not specified
Refinement of the CRM in 1C: displaying the client's bonus balance

Testing & QA 12 proposals 29 July

Not specified
Setting up multiple Viber accounts on one remote desktop

13 proposals 28 July

Not specified
Light application

PHP 68 proposals 28 July

173 USD

Sergey Popov
Mannheim, Germany

Projects 14
Rating -
Rating 161

Daniil Muntyan

Daniil Muntyan

Proposals are currently absent

Current freelance projects in the category Desktop Apps

Need to transfer the site from Webflow to WordPress.

Refinement of the CRM in 1C: displaying the client's bonus balance

Setting up multiple Viber accounts on one remote desktop

Light application