https://wenku.baidu.com/view/6a48d8d39f3143323968011ca300a6c30c22f10e.html?from=search
漫展解
I M++ O M-- FOR 0-XX.SIZE(); IF =='I' M++ IF =='0' M-- 1 A[J] = M J++ A[J] SORT(A,A+J+1) A[J] MAX A[0] MIN 2 A[J]=M A[J]>A[J+1] A[J+1]=A[J]
https://wenku.baidu.com/view/6a48d8d39f3143323968011ca300a6c30c22f10e.html?from=search
漫展解
I M++ O M-- FOR 0-XX.SIZE(); IF =='I' M++ IF =='0' M-- 1 A[J] = M J++ A[J] SORT(A,A+J+1) A[J] MAX A[0] MIN 2 A[J]=M A[J]>A[J+1] A[J+1]=A[J]
转载于:https://www.cnblogs.com/lightworkshopnoi/p/11368506.html