Tizzi的博客

一、内容In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sor...

一、内容 After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solution. As well, wily 3xian made lots of new problems abo...

一、内容给定很多歌坐标代表每个星星，一个星星它的左边和下边围起来的区域里面有多少个星星代表它是那个等级，问你0–N-1个等级中各有多少个星星属于。二、思路对坐标按照y从小到大进行排序，y相同的以x小的在前。 由于题目叫求左边和下边包含的星星的数量，按照y进行排序后，只需要用树状数组维护x坐标有多少个点即可。因为每次的点必然是大于或者等于上一个点的高度。题目给出的坐标可能是0，所以对x...