[高等演算法][作業二] 討論
前略3. Given an integer (not necessary a decimal number) with n digits, we want to remove m ( n)digits from this number such that the resulting number is as large as possibe. Design an O(n)time algorithm to solve it.4. Let x1, x2, … , xn be a sequence of integers and k be anot...
