Problem Statement

To You, In 2000 Years. Problem Description A three-person survey team is sent out on missions to reclaim lost territory. Each mission is broken into n distinct tasks, and the team has a preferred way of dividing the work: The scout always takes the opening tasks, covering the easier challenges from 1 to i. The strategist takes over next, handling the middle stretch of tasks, from i to j. The vanguard, the team's strongest fighter, tackles the hardest tasks at the end, from j to n. Missions go smoothly whenever the work is split this way - scout first, strategist in the middle, vanguard finishing up, with 1 <= i <= j <= n. After one especially chaotic mission, though, the tasks got shuffled, leaving each team member holding a random assortment of tasks out of the usual order. The team now needs to redistribute their tasks so they fall back into the preferred pattern - scout at the front, strategist in the middle, vanguard at the end. Only one task can change hands per move, whi