https://blog.youkuaiyun.com/FS_tarzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/FS_tar/article/details/154287193https://blog.youkuaiyun.com/FS_tar/article/details/154287193FS_tarSun, 02 Nov 2025 14:11:39 +0800https://blog.youkuaiyun.com/FS_tar/article/details/152412031https://blog.youkuaiyun.com/FS_tar/article/details/152412031FS_tarThu, 02 Oct 2025 15:15:56 +0800https://blog.youkuaiyun.com/FS_tar/article/details/152079339https://blog.youkuaiyun.com/FS_tar/article/details/152079339FS_tarThu, 25 Sep 2025 12:50:59 +0800> n;int y = 0;i <= n;cin >> x;a[x] = i;//每个数字插入的位置ls[i] = 0;rs[i] = 0;i <= n;while(!s.pop();if(!s.push(i);}//构建笛卡尔树dfs(y);cin.tie(0);int _ = 1;]]>https://blog.youkuaiyun.com/FS_tar/article/details/147811803https://blog.youkuaiyun.com/FS_tar/article/details/147811803FS_tarFri, 09 May 2025 09:56:23 +0800https://blog.youkuaiyun.com/FS_tar/article/details/147194321https://blog.youkuaiyun.com/FS_tar/article/details/147194321FS_tarSun, 13 Apr 2025 20:36:49 +0800https://blog.youkuaiyun.com/FS_tar/article/details/147046577https://blog.youkuaiyun.com/FS_tar/article/details/147046577FS_tarMon, 07 Apr 2025 16:16:05 +0800https://blog.youkuaiyun.com/FS_tar/article/details/144006898https://blog.youkuaiyun.com/FS_tar/article/details/144006898FS_tarMon, 24 Mar 2025 21:53:31 +0800https://blog.youkuaiyun.com/FS_tar/article/details/145811380https://blog.youkuaiyun.com/FS_tar/article/details/145811380FS_tarSun, 23 Feb 2025 17:31:27 +0800https://blog.youkuaiyun.com/FS_tar/article/details/145592929https://blog.youkuaiyun.com/FS_tar/article/details/145592929FS_tarSun, 16 Feb 2025 16:52:00 +0800https://blog.youkuaiyun.com/FS_tar/article/details/145445694https://blog.youkuaiyun.com/FS_tar/article/details/145445694FS_tarSun, 09 Feb 2025 18:02:41 +0800https://blog.youkuaiyun.com/FS_tar/article/details/145340237https://blog.youkuaiyun.com/FS_tar/article/details/145340237FS_tarFri, 07 Feb 2025 19:28:25 +0800https://blog.youkuaiyun.com/FS_tar/article/details/144927316https://blog.youkuaiyun.com/FS_tar/article/details/144927316FS_tarSun, 05 Jan 2025 14:55:55 +0800https://blog.youkuaiyun.com/FS_tar/article/details/144057826https://blog.youkuaiyun.com/FS_tar/article/details/144057826FS_tarTue, 26 Nov 2024 14:43:32 +0800https://blog.youkuaiyun.com/FS_tar/article/details/143659771https://blog.youkuaiyun.com/FS_tar/article/details/143659771FS_tarSun, 17 Nov 2024 15:53:20 +0800https://blog.youkuaiyun.com/FS_tar/article/details/140946392https://blog.youkuaiyun.com/FS_tar/article/details/140946392FS_tarSun, 27 Oct 2024 16:44:35 +0800https://blog.youkuaiyun.com/FS_tar/article/details/143191368https://blog.youkuaiyun.com/FS_tar/article/details/143191368FS_tarSun, 27 Oct 2024 16:41:30 +0800https://blog.youkuaiyun.com/FS_tar/article/details/142691254https://blog.youkuaiyun.com/FS_tar/article/details/142691254FS_tarSat, 12 Oct 2024 17:34:00 +0800A[j]的有序对叫作逆序对。一些简单朴素算法的时间复杂度都是O(n*n)，包括插入排序冒泡排序等等。归并排序二分一直二分到只有一个元素为止可以想象在二分时，逆序对有以上三种结果，全在左边，全在右边，一左一右全在左右的都不容易计算，所以继续归并排序如果在二分到仅剩一个元素时进行排序，那么当回来计算归并排序时，左右俩边应当是分别排序好的数组开始寻找逆序对个数，分别把左右俩个区间的最小值设置成i，j。]]>https://blog.youkuaiyun.com/FS_tar/article/details/142467748https://blog.youkuaiyun.com/FS_tar/article/details/142467748FS_tarMon, 23 Sep 2024 21:12:10 +0800https://blog.youkuaiyun.com/FS_tar/article/details/141198283https://blog.youkuaiyun.com/FS_tar/article/details/141198283FS_tarWed, 14 Aug 2024 20:16:23 +0800https://blog.youkuaiyun.com/FS_tar/article/details/141031106https://blog.youkuaiyun.com/FS_tar/article/details/141031106FS_tarThu, 08 Aug 2024 19:50:17 +0800