t14 的博客

题目Problem DescriptionTom and Jerry are going on a vacation. They are now driving on a one-way road and several cars are in front of them. To be more specific, there are n cars in front of them. The ...

题目思路疯狂想法：6层for循环，O(N6)算法。于是，看这句话：It is guaranteed that the sum of N3over all cases does not exceed 25 ⋅107肯定是让你想O(N3)算法。首先，枚举子矩阵的上下边界，维护上下边界的最大最小值。然后接着枚举右边界。可左边界怎么办呢，反正不能还枚举吧。左边界显然具有单调不降性。二分...

题目思路贪心 +++ 暴力枚举。这题要求截取最少数量的字符串，使得每个字符串在所有各自的循环字符串中字典序最小。首先，枚举截取字符串的开始位置。然后，枚举截取的长度（从长到短，贪心）。接着，截字符串。最后判断当前字符串是否为字典序最小的字符串。那么，判断的时候如何截取循环字符串呢？① 先从当前位置截取到最后，再从开始截取到当前位置，将这两段结合在一起。结合的操作string就...