<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[driver13的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/driver13</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; driver13]]></copyright><item><title><![CDATA[数据处理特征选取]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/79349786</link><guid>https://blog.youkuaiyun.com/driver13/article/details/79349786</guid><author>driver13</author><pubDate>Thu, 22 Feb 2018 21:48:15 +0800</pubDate><description><![CDATA[见这里：点击打开链接]]></description><category></category></item><item><title><![CDATA[GBDT]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/79343617</link><guid>https://blog.youkuaiyun.com/driver13/article/details/79343617</guid><author>driver13</author><pubDate>Thu, 22 Feb 2018 21:47:23 +0800</pubDate><description><![CDATA[基础原理：点击打开链接拓展：点击打开链接点击打开链接]]></description><category></category></item><item><title><![CDATA[二乘法/拟牛顿/梯度下降]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/79337030</link><guid>https://blog.youkuaiyun.com/driver13/article/details/79337030</guid><author>driver13</author><pubDate>Mon, 19 Feb 2018 15:16:53 +0800</pubDate><description><![CDATA[最小二乘法：点击打开链接梯度下降：点击打开链接牛顿迭代各种算法：点击打开链接]]></description><category></category></item><item><title><![CDATA[EM算法]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/79327230</link><guid>https://blog.youkuaiyun.com/driver13/article/details/79327230</guid><author>driver13</author><pubDate>Thu, 15 Feb 2018 00:00:01 +0800</pubDate><description><![CDATA[算法公式原理：点击打开链接例子计算：点击打开链接]]></description><category></category></item><item><title><![CDATA[机器学习-降维（PCA）]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/79302697</link><guid>https://blog.youkuaiyun.com/driver13/article/details/79302697</guid><author>driver13</author><pubDate>Sat, 10 Feb 2018 00:21:15 +0800</pubDate><description><![CDATA[原理见这里点击打开链接协方差矩阵解释见这里点击打开链接]]></description><category></category></item><item><title><![CDATA[svm流程与公式推导]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/79301742</link><guid>https://blog.youkuaiyun.com/driver13/article/details/79301742</guid><author>driver13</author><pubDate>Fri, 09 Feb 2018 20:44:46 +0800</pubDate><description><![CDATA[总流程见这里：点击打开链接1.求出目标函数2.将目标函数与约束条件转化为拉格朗日乘子形式，并且转化为对偶问题进行解决点击打开链接3.根据转化为的对偶问题进行求最大值。这里需要利用smo算法。点击打开链接点击打开链接...]]></description><category></category></item><item><title><![CDATA[状压dp训练]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/54986664</link><guid>https://blog.youkuaiyun.com/driver13/article/details/54986664</guid><author>driver13</author><pubDate>Sat, 11 Feb 2017 21:11:03 +0800</pubDate><description><![CDATA[cdoj 1159 不知道为什么这么水的题目我都花了好久来思考，（真的比较水），n=20,很明显是状压dp,但是k=10^9,这个的确有点吓人，但是转换一下思想，把k中的每个数分开考虑，然后状压，就可以了，用快速幂优化一下就可以了。
bzoj 3812 这题还是比较神的，dp[i]表示i状态时，至少有n个不联通的情况种数，注意是至少n个不联通（这个n包括了所有可能），容斥的时候注意要反一下，把d]]></description><category></category></item><item><title><![CDATA[kmp模板]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/51426341</link><guid>https://blog.youkuaiyun.com/driver13/article/details/51426341</guid><author>driver13</author><pubDate>Mon, 16 May 2016 16:49:50 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define maxn 100009
#define inf 0x3f3f3f3f
#define mod 1000000007
#define Mat_size 11
using namespace std;
char s[maxn];]]></description><category></category></item><item><title><![CDATA[hdu 4612 tarjian求桥双连通分量缩点+树直径]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50580153</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50580153</guid><author>driver13</author><pubDate>Mon, 25 Jan 2016 14:57:55 +0800</pubDate><description><![CDATA[感觉hdu上数据有点水，但不知道哪组数据可以cha掉我的代码，求告知>-
感觉以后树的直径代码还是统一规范一下，即兴写的。
//hdu 4612 tarjian边双连通缩点+树的直径
#include 
#include 
#include 
#include 
#include 
#include 
#define inf 0x3f3f3f3f
#define lowbit(x) ((x)&]]></description><category></category></item><item><title><![CDATA[LA 3523 tarjian求双连通分量+二分判奇圈]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50580124</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50580124</guid><author>driver13</author><pubDate>Mon, 25 Jan 2016 14:53:59 +0800</pubDate><description><![CDATA[白书上有详细解说
代码与书上有些不同，但核心是相通的
//LA 3523 点双连通+二分判奇圈
#include 
#include 
#include 
#include 
#include 
#include
#include 
#define inf 0x3f3f3f3f
#define lowbit(x) ((x)&(-x))
#define maxn 1050
using names]]></description><category></category></item><item><title><![CDATA[hdu 4738 tarjian求桥]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50580109</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50580109</guid><author>driver13</author><pubDate>Mon, 25 Jan 2016 14:50:50 +0800</pubDate><description><![CDATA[//hdu 4738 tarjian求桥
#include 
#include 
#include 
#include 
#include 
#define inf 0x3f3f3f3f
#define lowbit(x) ((x)&(-x))
#define maxn 1000005
using namespace std;
int dfn[maxn],low[maxn],n,m,ans,hea]]></description><category></category></item><item><title><![CDATA[hdu 4587 tarjian求割点数目]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50580078</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50580078</guid><author>driver13</author><pubDate>Mon, 25 Jan 2016 14:49:13 +0800</pubDate><description><![CDATA[看注释就好了，我写的还是比较仔细的。
//hdu 4587 tarjian 求割点
#include 
#include 
#include 
#include 
#include 
#define inf 0x3f3f3f3f
#define lowbit(x) ((x)&(-x))
#define maxn 20005
using namespace std;
int dfn[maxn],l]]></description><category></category></item><item><title><![CDATA[hdu 4399 树形dp]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50580039</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50580039</guid><author>driver13</author><pubDate>Mon, 25 Jan 2016 14:45:29 +0800</pubDate><description><![CDATA[题意比较难理解>-//hdu 4799 树形dp
#include 
#include 
#include 
#include 
#include 
#define inf 0x3f3f3f3f
#define lowbit(x) ((x)&(-x))
#define maxn 50055
using namespace std;
int dp[maxn][5],val[maxn],sta[max]]></description><category></category></item><item><title><![CDATA[hdu 3966 树链剖分（坑内存）]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50557298</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50557298</guid><author>driver13</author><pubDate>Thu, 21 Jan 2016 19:50:42 +0800</pubDate><description><![CDATA[//hdu 3966 树链剖分+树状数组(节点)
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include 
#include 
#include 
#include 
#include 
#define lowbit(x) ((x)&(-x))
#define LL long long
#define maxn 50005
]]></description><category></category></item><item><title><![CDATA[hdu 5593 树形dp]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50557280</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50557280</guid><author>driver13</author><pubDate>Thu, 21 Jan 2016 19:47:36 +0800</pubDate><description><![CDATA[//hdu 5593 树形dp
#include 
#include 
#include 
#include 
#include 
#define LL long long
#define maxn 500005
using namespace std;
int dp[maxn][15];
int k,n;
vector g[maxn];

void dfs(int a)
{
    dp[a][]]></description><category></category></item><item><title><![CDATA[hdu 5592 线段树]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50557277</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50557277</guid><author>driver13</author><pubDate>Thu, 21 Jan 2016 19:45:37 +0800</pubDate><description><![CDATA[//hdu 5592 线段树(傻逼题)
#include 
#include 
#include 
#include 
#define maxn 50005
using namespace std;
struct Tree
{
    int l,r,len;
}tree[maxn*6];
int a[maxn],b[maxn];

void build(int a,int l,int r)
{
]]></description><category></category></item><item><title><![CDATA[spoj 375 树链剖分（裸模板）]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50536674</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50536674</guid><author>driver13</author><pubDate>Mon, 18 Jan 2016 14:48:37 +0800</pubDate><description><![CDATA[看来以后树链剖分要用这个模板了。具体效果怎么样，还要看看，机场wifi太TM慢了。
寒假估计要是有史以来最辛苦的了。寒假疯狂AC万岁。
//树链剖分模板
/*
记siz[v]表示以v为根的子树的节点数，dep[v]表示v的深度(根深度为1)，top[v]表示v所在的链的顶端节点，fa[v]表示v的父亲，
son[v]表示与v在同一重链上的v的儿子节点（姑且称为重儿子），w[v]表示v与其父亲节]]></description><category></category></item><item><title><![CDATA[Codeforces Round #338 (Div. 2) C. Running Track (dp)]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50490407</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50490407</guid><author>driver13</author><pubDate>Sat, 09 Jan 2016 23:26:28 +0800</pubDate><description><![CDATA[由于这题目要求输出的时候序号要尽量小，没看到，所以呵呵了。
属于dp，注释都在代码中间了。貌似自己面对这种要输出答案解，并且要求序号小的题目很是蛋疼。
//Codeforces Round #338 (Div. 2) C. Running Track (dp)
#include
#include
#include
#include
#include
#include
#define mod 1]]></description><category></category></item><item><title><![CDATA[poj 1038 状态压缩]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50488674</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50488674</guid><author>driver13</author><pubDate>Sat, 09 Jan 2016 17:21:45 +0800</pubDate><description><![CDATA[这道题还是比较基础的状态压缩dp,但有几个点还是要去注意一下，注意点代码的注释中已经给出来了。
//poj 1038 状态压缩dp
#include
#include
#include
#include
#include
#include
#define mod 105225319
#define maxn 100000
using namespace std;
int dp[3][maxn];]]></description><category></category></item><item><title><![CDATA[hdu 5555 状态压缩dp]]></title><link>https://blog.youkuaiyun.com/driver13/article/details/50488620</link><guid>https://blog.youkuaiyun.com/driver13/article/details/50488620</guid><author>driver13</author><pubDate>Sat, 09 Jan 2016 17:09:10 +0800</pubDate><description><![CDATA[这题目还是比较隐蔽的，不知道如何进行dp。
其实往简单的方面去想也是可以的，当最左边的青蛙确定好位置之后，再考虑他之后的一个青蛙状态。
注意一下，由于bad位置有10个，我们可以运用状态压缩来解决，之后的其他膜肯定覆盖了全部位置，因此其他膜可以随便去挑位置。
//hdu 5555 状态压缩dp
#include
#include
#include
#include
#include
#def]]></description><category></category></item></channel></rss>