Task: Implement a Data Structure with O(1) Insert, Delete, and Maximum Operations

Task: Implement a Data Structure with O(1) Insert, Delete, and Maximum Operations: a task in Terminal-Lego-15k (Harbor dataset). This is a classic algorithm design problem. The key insight is to use a stack-based approach with an auxiliary structure to track maximum values.