I've got 4 works to do in the Fiver. My semester final exam is ahead. It is not possible for me to do so much work now. So I want to leave the ones that are more profitable and reject the rest. This is the problem
4. I've got 4 works to do in the Fiver. My semester final exam is ahead. It is not possible
for me to do so much work now. So I want to leave the ones that are more profitable
and reject the rest.This is my problem.
Problem
6. Now What will
Now What will
be the
be the
algorithm of
algorithm of
this problem!!
this problem!!
7. Algorithm
1
First, take the day array and the
value
2
Starting from N = Serial no,
T = Days.
5
6
will take that job in the least
number of days
Firstly, filled with the basis of
dynamic programming: Line 0
includes all zeros
3
4
Using recursive formulas, use
line 0 to calculate line 1, use line
1 to calculate line 2, etc. ... until
all lines are calculated.
If the next line element is
greater than the previous line
element then print the value
otherwise print the previous one