Home/ Questions/Q 6835375
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-26T23:13:30+00:00

I have a problem to solve like this. there is time interval, and each

  • 0

I have a problem to solve like this.

there is time interval, and each time interval can do work once. (I called this, ‘task’)

if there (4, 8), (1, 3), (8, 10), (0, 3), (6, 8) time interval and each interval means (start time, deadline).

this is one case idle time is three (an idle time is between tasks)

enter image description here

But I want to minimize idle time

enter image description here

How to solve these like problem by problem solving?
my friend suggests ‘dynamic programming’ which is one of problem solving technique, I don’t know what it is.
Please help me, what is dynamic programming and examples by this problem.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Maybe your friend means to find T1, T2, etc. with idle time in between and try to shorten this? In general dp means to eliminate variables that are unecessary for the solution thus speed up the overall compute time. Here is a good link: difference between back tracking and Dynamic programming

    • 0