baoff

摘要： Problem DescriptionYou are given a array with N nodes. The array nodes are numbered from 1 to N ( represented by a_i ). In the start, the colorof any node in the array is white or black. We define that the "distance" between a and b is min{a_i| a k，初始化时记下在i左侧最近的小于k的数字的位置L[i]，同理R[i]。找到L[i]左 阅读全文