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

POI 2004 - Maximal Order of Permutations

Authors: Andi Qu, Benjamin Qi

Edit This Page

Appears In

  • Gold - Knapsack DP
View Problem Statement

Hint 1

Hint 2

Hint 3

Hint 4

Hint 5

Hint 6

Solution

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