HDU 1087 - Super Jumping! Jumping! Jumping!
Problem : N values list from left to right. Player must start at the left end, jump from left to right, and the value of jump position should get larger than last one. Find the maximum sum of jumping path.
Solution : The walk way is a DAG. Thus it is the same as the maximum value of a DAG path, which is a DAG DP.