USACO Guide
Math
DivisibilityModular ArithmeticCombinatorics
Dynamic Programming
Introduction to DPKnapsack DPPaths on GridsLongest Increasing SubsequenceBitmask DPRange DPDigit DP
Graphs
Shortest Paths with Unweighted EdgesDisjoint Set UnionTopological SortShortest Paths with Non-Negative Edge WeightsMinimum Spanning Trees
Data Structures
More Operations on Sorted Sets(Optional) Sorted Sets with Custom ComparatorsStacksSliding WindowPoint Update Range Sum
Trees
Euler Tour TechniqueDP on Trees - IntroductionDP on Trees - Solving For All Roots
Additional Topics
Hashing(Optional) HashmapsMeet In The MiddleOptimizing Unimodal Functions
Conclusion
Additional Practice for USACO Gold
Settings

LMIO 2019 - Rabbit Carrot

Authors: Benjamin Qi, Kevin Sheng

Edit This Page

Appears In

  • Gold - Longest Increasing Subsequence
View Problem Statement

Hint

Condition

Final Steps

Bonus: Can you solve the case where the rabbit can jump at most MMM units down and at most MMM units up?

Spoiler

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

Join Forum