| Title |
User |
Message |
Date Posted |
| Re: Constraint |
jargon |
Assume the elevation can fit in a standard integer type. |
Dec 26, 2017 - 7:16:29 pm UTC |
| Constraint |
abcConjecture |
Is there a constraint on the elevation values? |
Dec 26, 2017 - 5:58:55 pm UTC |
| Contest year? |
SharkRetriever |
It says "1997 Canadian Computing Competition, Stage 1" for some reason even though problem is 1998. |
Jun 26, 2014 - 9:52:12 pm UTC |
| Re: Isn't the answer for the first case 4? |
jargon |
If the elevation at either the beginning or the end of the step requires oxygen, a unit of oxygen is consumed by Alp during the step. ... |
Jan 05, 2014 - 1:03:57 am UTC |
| Isn't the answer for the first case 4? |
fifiman |
right,down,right,down,left,down,down,right,right,right. 5->4->5->6->8->8->6->5->4->5->3 Only the 6,8,8,6 use oxygen, = 4 |
Jan 04, 2014 - 10:28:39 pm UTC |
| Re: Output |
dAedaL |
Yes. "For each trip, if a passage exists, the output is a single line containing an integer indicating the number of units of oxygen consumed. If a passage does not exist, the output is a single line... |
Jan 06, 2009 - 11:16:15 pm UTC |
| Output |
Bryan |
If there is a passage, are we supposed to output the least amount of oxygen consumed possible? |
Jan 06, 2009 - 10:36:43 pm UTC |
| Re: Re: Dynamic Programming? |
bbi5291 |
If it can't be done bottom-up, then it's not dynamic. Evidently recursive-dynamic is not a subset of dynamic. Edit: anyways, Hanson told me how to remove it, so it's done. |
Dec 16, 2008 - 10:40:09 pm UTC |
| Re: Dynamic Programming? |
SourSpinach |
Recursive-dynamic is a subset of Dynamic. This problem is Recursive-dynamic. Therefore, this problem is Dynamic. QED |
Dec 16, 2008 - 10:23:11 pm UTC |
| Dynamic Programming? |
bbi5291 |
I don't think this is a DP problem; none of the solutions are dynamic (Jacob calls his "recursive-dynamic", but it's not dynamic in the true sense of the term). I think it should be removed from the D... |
Dec 16, 2008 - 9:47:11 pm UTC |
