At Rubrik, ensuring data durability is paramount. We analyze various data segments within a customer's environment, and each segment is assigned a "Data Durability Score". A higher score indicates better resilience and protection. We're interested in identifying "Data Durability Windows", which are continuous sequences of these data segments. For any such window, its "Minimum Durability" is simply the lowest Data Durability Score found within that window. This represents the weakest link in that particular sequence. Your task is to help our engineers understand the overall durability posture. For every possible length k (from 1 up to N), you need to find the highest possible Minimum Durability that can be achieved across all Data Durability Windows of that specific length k.