<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_55731597的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_55731597</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_55731597]]></copyright><item><title><![CDATA[spdlog导入到应用]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/129116809</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/129116809</guid><author>m0_55731597</author><pubDate>Mon, 20 Feb 2023 00:56:26 +0800</pubDate><description><![CDATA[spdlog 入门，下载 导入 使用 简单示例 ]]></description><category></category></item><item><title><![CDATA[Boost网络编程,recv,read_some,第二次无法读取，数据不完整]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/129075575</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/129075575</guid><author>m0_55731597</author><pubDate>Fri, 17 Feb 2023 00:13:12 +0800</pubDate><description><![CDATA[boost asio socket recv read_some 第二次无法读取， tpc/ip ，包不完整，C++网络编程简单的客服端服务端]]></description><category></category></item><item><title><![CDATA[增减序列为什么要五个字]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/129051610</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/129051610</guid><author>m0_55731597</author><pubDate>Wed, 15 Feb 2023 22:17:58 +0800</pubDate><description><![CDATA[给定一个长度为n的数列a1,a2,…,an，每次可以选择一个区间[l,r]，使下标在这个区间内的数都加一或者都减一。求至少需要多少次操作才能使数列中的所有数都一样，并求出在保证最少次数的前提下，最终得到的数列可能有多少种。输入格式第一行输入正整数n。接下来n行，每行输入一个整数，第i+1行的整数代表ai。输出格式第一行输出最少操作次数。第二行输出最终能得到多少种结果。数据范围0]]></description><category></category></item><item><title><![CDATA[激光炸弹-水一下]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/129051357</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/129051357</guid><author>m0_55731597</author><pubDate>Wed, 15 Feb 2023 21:59:45 +0800</pubDate><description><![CDATA[那么 中间x*x的矩阵的面积 等于 t[i][j]-t[i-x][j]-t[i][j-x]+t[i-x][j-x]激光炸弹的投放是通过卫星定位的，但其有一个缺点，就是其爆炸范围，即那个正方形的边必须和。，分别代表地图上的目标数目和正方形包含的横纵位置数量，数据用空格隔开。我们要做的就是把最开始的图形处理成和的形式，然后找出最大的面积区域。输出一个正整数，代表一颗炸弹最多能炸掉地图上目标的总价值数目。假设t[i][j]表示 （0，0）到（i，j）矩形的面积，表示目标在地图上的位置，每个目标都有一个价值。]]></description><category></category></item><item><title><![CDATA[分形之城--没过，吃宵夜去了，生蚝真好吃]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/129050841</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/129050841</guid><author>m0_55731597</author><pubDate>Wed, 15 Feb 2023 21:43:03 +0800</pubDate><description><![CDATA[右上是左上左旋转90°，再向上翻转180°得到的 （如果只是单纯的图形 旋转90°就可以得到，但是我希望得到一个入出口一样的图形 就需要再翻转一次）当城区规模扩大之后，Fractal 的解决方案是把和原来城区结构一样的区域按照图中的方式建设在城市周围，提升城市的等级。在区间[53,53],[54,54],[55,55],[56,56]中 55位于第三区间 ji[1][1]不幸的是，很多城市在开始建设的时候并没有很好的规划，城市规模扩大之后规划不合理的问题就开始显现。]]></description><category></category></item><item><title><![CDATA[大整数乘法]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/128997901</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/128997901</guid><author>m0_55731597</author><pubDate>Sun, 12 Feb 2023 18:34:44 +0800</pubDate><description><![CDATA[比如3*7 = 3*（1+2+4）= （3*1）+（3*2）+（3*4）其中每次a都需要扩大2倍（不要忘记扩大之后要取模）拆分的规律是把数用二进制表示 7D=111B。从最低位开始遍历b在二进制下哪些位置是1。用Ull和ull都可以 看个人习惯；函数中 ans用来统计最后的答案。如果是1就ans就加上对应的数字。用乘法分配律拆开b(或者a）所以说 c++ 去XX。]]></description><category></category></item><item><title><![CDATA[注水水水注6.27出蓝桥]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125490554</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125490554</guid><author>m0_55731597</author><pubDate>Mon, 27 Jun 2022 19:45:01 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.27 名字的漂亮度]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125485154</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125485154</guid><author>m0_55731597</author><pubDate>Mon, 27 Jun 2022 15:31:15 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.17 字符串加解密]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125341129</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125341129</guid><author>m0_55731597</author><pubDate>Fri, 17 Jun 2022 22:24:14 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.16 输入整型数组和排序标识，对其元素按照升序或降序进行排序]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125321377</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125321377</guid><author>m0_55731597</author><pubDate>Thu, 16 Jun 2022 18:45:58 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.16 输入n个整数，输出其中最小的k个]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125321362</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125321362</guid><author>m0_55731597</author><pubDate>Thu, 16 Jun 2022 18:45:22 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.15 后缀表达式]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125298700</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125298700</guid><author>m0_55731597</author><pubDate>Wed, 15 Jun 2022 16:33:13 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.15 数字颠倒]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125298690</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125298690</guid><author>m0_55731597</author><pubDate>Wed, 15 Jun 2022 15:50:24 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.14 字符个数统计]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125286210</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125286210</guid><author>m0_55731597</author><pubDate>Tue, 14 Jun 2022 21:07:41 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.14 链表合并]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125286199</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125286199</guid><author>m0_55731597</author><pubDate>Tue, 14 Jun 2022 21:06:46 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.14 组合数（1）]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125286179</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125286179</guid><author>m0_55731597</author><pubDate>Tue, 14 Jun 2022 21:06:00 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[位运算-入门]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125265962</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125265962</guid><author>m0_55731597</author><pubDate>Mon, 13 Jun 2022 19:24:05 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[单元最短路（非堆优化）]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125265898</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125265898</guid><author>m0_55731597</author><pubDate>Mon, 13 Jun 2022 19:20:31 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[基础算法鸭]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125265752</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125265752</guid><author>m0_55731597</author><pubDate>Mon, 13 Jun 2022 19:08:56 +0800</pubDate><description><![CDATA[无]]></description><category></category></item><item><title><![CDATA[6.12日硬盘糟心]]></title><link>https://blog.youkuaiyun.com/m0_55731597/article/details/125265245</link><guid>https://blog.youkuaiyun.com/m0_55731597/article/details/125265245</guid><author>m0_55731597</author><pubDate>Mon, 13 Jun 2022 18:26:32 +0800</pubDate><description><![CDATA[无]]></description><category></category></item></channel></rss>