<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[speroc的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/speroc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; speroc]]></copyright><item><title><![CDATA[动态规划大纲211102]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/121093377</link><guid>https://blog.youkuaiyun.com/speroc/article/details/121093377</guid><author>speroc</author><pubDate>Tue, 02 Nov 2021 09:14:51 +0800</pubDate><description><![CDATA[动态规划问题的基本思想：
（1）动态规划问题的关键在于正确地写出基本的递推关系式和恰当的边界条件来完成状态转移方程。要做到这一点，必须将问题的过程划分成几个相互联系的阶段，选取恰当的状态变量，决策变量以及定义最优值函数，从而把一个大问题化成一族同类型的子问题 , 然后逐个求解。即从边界条件开始 , 逐段递推寻优 , 在每一个子问题的求解中 , 均利用了它前面的子问题的最优化结果 , 依次进行 , 最后一个子问题所得的最优解 , 就是整个问题的最优解。
（2）在多阶段决策的过程中，动态规划方法是既把当前一段.]]></description><category></category></item><item><title><![CDATA[矩阵快速幂做斐波那契数列]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/107188631</link><guid>https://blog.youkuaiyun.com/speroc/article/details/107188631</guid><author>speroc</author><pubDate>Tue, 07 Jul 2020 19:37:50 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
using namespace std;
const int mod = 10000;
int n;
struct mat{                                           
 long long a[5][5];
};
mat operator *(mat x,mat y)
{]]></description><category></category></item><item><title><![CDATA[暑假训练数论板子]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/107174741</link><guid>https://blog.youkuaiyun.com/speroc/article/details/107174741</guid><author>speroc</author><pubDate>Tue, 07 Jul 2020 15:23:46 +0800</pubDate><description><![CDATA[快速幂
int ksm(int a,int b)
{
int i=1,x=a;
while(b!=0)
{
if(b&amp;1)
i*=x;
x*=x;
b&gt;&gt;=1;
}
return i;
}
矩阵乘法
struct mat{                                           //定义矩阵结构体
 long long a[maxn][maxn];
};
mat operator*(mat x,mat y){                 //重载乘号(定义]]></description><category></category></item><item><title><![CDATA[数位dp解不要62注释]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104349672</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104349672</guid><author>speroc</author><pubDate>Fri, 03 Apr 2020 11:11:45 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
using namespace std;
int dp[10][3];
void Init(){    //预处理，算出所有可能
    memset(dp,0,sizeof(dp));
    dp[0][0]=1;
    for(int i=1;i&...]]></description><category></category></item><item><title><![CDATA[二叉树的四种遍历(非递归)迭代打印]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/105288683</link><guid>https://blog.youkuaiyun.com/speroc/article/details/105288683</guid><author>speroc</author><pubDate>Fri, 03 Apr 2020 11:10:55 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;stack&gt;
#include&lt;queue&gt;
using namespace std;
template&lt;typename Elem&gt;
struct BinNode{
 Elem data;
 BinNode&lt;Elem&gt; *left;
 BinNode&lt;Elem&gt; *ri...]]></description><category></category></item><item><title><![CDATA[sunday算法注释]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104914889</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104914889</guid><author>speroc</author><pubDate>Fri, 03 Apr 2020 09:40:58 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;string&gt;
#define MAX_CHAR 256//用字符对应的ascii码作为数组下标
#define MAX_LENGTH 1000
using namespace std;
void GetNext(string &amp; p, int &amp; m, int next[])
{
    for ...]]></description><category></category></item><item><title><![CDATA[python3输出bytes时的小问题]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/105178634</link><guid>https://blog.youkuaiyun.com/speroc/article/details/105178634</guid><author>speroc</author><pubDate>Sun, 29 Mar 2020 14:43:21 +0800</pubDate><description><![CDATA[使用python3的bytes转换字符串时,如果是输出单个字符则会输出其编码值,如果输出多于一个字符例如print(name[begin:end]),如果字符串内字符存在ascii编码内则原样输出字符,如果不存在则输出其国际十六进制编码

...]]></description><category></category></item><item><title><![CDATA[无向图判断是否有环并输出环]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/105175319</link><guid>https://blog.youkuaiyun.com/speroc/article/details/105175319</guid><author>speroc</author><pubDate>Sun, 29 Mar 2020 11:16:42 +0800</pubDate><description><![CDATA[void dfsVisit(vector&lt;vector&lt;int&gt; &gt;&amp;graph, int node, vector&lt;int&gt;&amp;visit,
               vector&lt;int&gt;&amp;father)
{
    int n = graph.size();
    visit[node] = 1;//正在遍历状态
 ...]]></description><category></category></item><item><title><![CDATA[dfs拓扑]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/105162098</link><guid>https://blog.youkuaiyun.com/speroc/article/details/105162098</guid><author>speroc</author><pubDate>Sat, 28 Mar 2020 15:32:53 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstring&gt;
using namespace std;
int n,m,topo[100];       //topo数组用来储存最终形成的拓扑序列
int G[100][100];          //储存有序对信息
int c[100];               //储存每个节点是否被访问过的信息
int...]]></description><category></category></item><item><title><![CDATA[迭代法拓扑排序]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/105161531</link><guid>https://blog.youkuaiyun.com/speroc/article/details/105161531</guid><author>speroc</author><pubDate>Sat, 28 Mar 2020 15:32:16 +0800</pubDate><description><![CDATA[this topologically sort 用到了优先队列把同级的节点排序
#include&lt;iostream&gt;
#include&lt;cstring&gt;
using namespace std;
int n,m,topo[100];       //topo数组用来储存最终形成的拓扑序列
int G[100][100];          //储存有序对信息
int c[1...]]></description><category></category></item><item><title><![CDATA[dp回文子串]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/105140133</link><guid>https://blog.youkuaiyun.com/speroc/article/details/105140133</guid><author>speroc</author><pubDate>Fri, 27 Mar 2020 14:07:13 +0800</pubDate><description><![CDATA[要知道i,j之间的字符串是否是回文串只需要知道(i+1,j-1)是否是回文串并判断arr[i]是否等于arr[j]就可以了
class Solution {
public:
    string longestPalindrome(string s) {
  vector&lt;vector&lt;bool&gt;&gt; dp(s.length(),vector&lt;bool&gt;(s.le...]]></description><category></category></item><item><title><![CDATA[桶排序注释]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104967770</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104967770</guid><author>speroc</author><pubDate>Thu, 19 Mar 2020 14:55:33 +0800</pubDate><description><![CDATA[#include&lt;iterator&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
using namespace std;
const int BUCKET_NUM = 10;
struct ListNode{
        explicit ListNode(int i=0):mData(i),mNext(NULL){}//加关键...]]></description><category></category></item><item><title><![CDATA[基数排序注释]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104965144</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104965144</guid><author>speroc</author><pubDate>Thu, 19 Mar 2020 12:59:10 +0800</pubDate><description><![CDATA[基数排序是一种稳定排序所以每一次排序并不会破坏原有的同级大小关系
所以可以对每一位数分别排序最后将整个数组有序
int maxbit(int data[], int n) //辅助函数，求数据的最大位数
{
    int maxData = data[0];              ///&lt; 最大数
    /// 先求出最大数，再求其位数，这样有原先依次每个数判断其位数，稍微优化点。
...]]></description><category></category></item><item><title><![CDATA[volatile关键字简析]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104856063</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104856063</guid><author>speroc</author><pubDate>Sat, 14 Mar 2020 10:35:52 +0800</pubDate><description><![CDATA[volatile主要用来防止变量的值由于某些不被编译器知道外来进程的原因而改变,加上volatile关键字后可以让编译器每次都从变量的内存地址获取值,而不是认定变量未改变就把上次读取的值认定为变量的值

...]]></description><category></category></item><item><title><![CDATA[一道体现与大佬差距的水题注释]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104849112</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104849112</guid><author>speroc</author><pubDate>Fri, 13 Mar 2020 21:05:58 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;algorithm&gt;
using namespace std;
int main() {
    int n, a[100], b[100], i, j;
    cin &gt;&gt; n;
    for (int i = 0; i &lt; n; i++)
        cin &gt;&gt; a[i]...]]></description><category></category></item><item><title><![CDATA[最大堆操作]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104848104</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104848104</guid><author>speroc</author><pubDate>Fri, 13 Mar 2020 19:52:18 +0800</pubDate><description><![CDATA[//插入后调整
void Maxheap_In(int start){//start是插入点位置一般为最后一个空元素位置
    int c=start;//current当前节点位置
    int p=(c-1)/2;//父节点位置
    int temp=arr[c];//记录当前位置数据
    while(c&gt;=0&amp;&amp;temp&lt;arr[p]){
      ...]]></description><category></category></item><item><title><![CDATA[STLequal函数简析]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104841418</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104841418</guid><author>speroc</author><pubDate>Fri, 13 Mar 2020 15:06:23 +0800</pubDate><description><![CDATA[equal使用时参数可以用第一个容器的比对开始迭代器以及比对结束的下一个迭代器和第二个容器的比对开始迭代器
比对元素数量由前两个参数确定;
如果增添第四个参数即第二个容器的比对结束的下一个迭代器
则比对元素由比对元素较多的容器确定,
但此方法私以为并无用,比对元素数量都不同直接用.size()比较不就可以了吗
函数的返回值为bool类型

...]]></description><category></category></item><item><title><![CDATA[boolalpha作用]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104841211</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104841211</guid><author>speroc</author><pubDate>Fri, 13 Mar 2020 14:56:47 +0800</pubDate><description><![CDATA[boolalpha是定义在&lt;iostream&gt;里的一个函数
作用是将bool变量的值输出从0和1变为false和true

]]></description><category></category></item><item><title><![CDATA[智能指针简析]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104840624</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104840624</guid><author>speroc</author><pubDate>Fri, 13 Mar 2020 14:45:13 +0800</pubDate><description><![CDATA[在c++11中增添了智能指针这个模板概念
使用时需添加头文件&lt;memory&gt;
定义时可以使用的类型包括自定义类型下面用模板类型T代替
两种形式:
shared_ptr&lt;T&gt;ptr(new T);
T *p=new T;
shared_ptr&lt;T&gt;ptr(p);

注意的是
不可以用两个智能指针都直接对指针p托管;
否则会重复释放造成程序崩溃
可以通过已经托管p的...]]></description><category></category></item><item><title><![CDATA[四博弈论小结]]></title><link>https://blog.youkuaiyun.com/speroc/article/details/104793203</link><guid>https://blog.youkuaiyun.com/speroc/article/details/104793203</guid><author>speroc</author><pubDate>Thu, 12 Mar 2020 23:11:35 +0800</pubDate><description><![CDATA[???你在干嘛快去收藏夹复习去

]]></description><category></category></item></channel></rss>