Inequality Sign

Problem

BaekJoon 2529 Inequality Sign

Ranking

• 1st place in Python3 (2023.01.21)

Algorithm

• DFS (Back-Tracking)

  Algorithm of others who are highly ranked

  Time Complexity: O(V+E) (V: 10)

• Greedy

  My Algorithm

  Count the length of each decreasing/increasing sequence, and apply max/min integer array for each seqeunce

  Time complexity: O(N) (N: 10, total operations: 20)