Solution Problem 6 (Education Round — G) You are given an array 0≤ai≤1090≤ai≤109 of 1≤n≤2⋅1051≤n≤2⋅105 integers. You have to find the maximum number of segments this array can be partitioned into, such that - 1. Each element is contained in exactly one segment 2. ...