树状数组
安庆闪耀
这个作者很懒,什么都没留下…
展开
-
poj 2299 Ultra-QuickSort(求逆序对)
Description 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 seque原创 2016-04-10 20:46:27 · 438 阅读 · 0 评论 -
poj 1804 Brainman(求逆序对)
Description Background Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even c原创 2016-04-10 20:45:16 · 949 阅读 · 0 评论 -
poj 3067 Japan(求逆序对)
Description Japan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <原创 2016-04-10 20:43:57 · 398 阅读 · 0 评论