<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ccshijtgc的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ccshijtgc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ccshijtgc]]></copyright><item><title><![CDATA[ubuntu下安装rtl8811cu/rtl8821cu网卡 Tplink WDN5200H网卡]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/91392751</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/91392751</guid><author>ccshijtgc</author><pubDate>Mon, 10 Jun 2019 19:00:00 +0800</pubDate><description><![CDATA[由于要wifi调试，笔记本内置的网卡有点不太灵光，买了个TPLINK的WDN5200HAC网卡，给虚拟机用，折腾一下成功了
github上有rtl8821cu/rtl8811cu的驱动和安装方法，但是时间有点久了，新的内核计时器改变了很多，所以驱动已经过时，找到一个新的内核驱动，查看我的资源可以下载，github可以不用资源分下载驱动，如果看官愿意打赏一下我辛苦整理，那就下载一下我的资源吧...]]></description><category></category></item><item><title><![CDATA[一、线性回归]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/86570027</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/86570027</guid><author>ccshijtgc</author><pubDate>Mon, 21 Jan 2019 10:30:15 +0800</pubDate><description><![CDATA[模型表示
让我们通过一个例子来开始：这个例子是预测住房价格的，我们要使用一个数据集，数据集包含俄勒冈州波特兰市的住房价格。在这里，我要根据不同房屋尺寸所售出的价格，画出我的数据集。比方说，如果你朋友的房子是1250平方尺大小，你要告诉他们这房子能卖多少钱。那么，你可以做的一件事就是构建一个模型，也许是条直线，从这个数据模型上来看，也许你可以告诉你的朋友，他能以大约220000(美元)左右的价格卖掉...]]></description><category></category></item><item><title><![CDATA[HDU 1245 Saving James Bond(floyd)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83376630</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83376630</guid><author>ccshijtgc</author><pubDate>Thu, 25 Oct 2018 11:11:35 +0800</pubDate><description><![CDATA[Saving James Bond


#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;cmath&amp;gt;
#include &amp;lt;algorithm&amp;gt;

using namespace std;
const double inf = 100000000;
double map[105][105];
int s[1...]]></description><category></category></item><item><title><![CDATA[poj 2411 Mondriaan's Dream(状压dp)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83342959</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83342959</guid><author>ccshijtgc</author><pubDate>Wed, 24 Oct 2018 13:55:24 +0800</pubDate><description><![CDATA[Mondriaan's Dream


#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstdlib&amp;gt;

using namespace std;
int N, M;//棋盘的宽和长
long long dp[15][4096];////dp[i][j]用于存储填...]]></description><category></category></item><item><title><![CDATA[HDU1596:find the safest road(Dijkstra)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83306312</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83306312</guid><author>ccshijtgc</author><pubDate>Tue, 23 Oct 2018 14:25:41 +0800</pubDate><description><![CDATA[find the safest road


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;math.h&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;

const double inf = 1000000;
int n, m;
double map[1005...]]></description><category></category></item><item><title><![CDATA[HDU 1599 find the mincost route(floyd)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83304633</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83304633</guid><author>ccshijtgc</author><pubDate>Tue, 23 Oct 2018 11:42:42 +0800</pubDate><description><![CDATA[find the mincost route


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
const int inf = 100000000;
int n, m, ans;
int map[105][105];
int dis[105][10...]]></description><category></category></item><item><title><![CDATA[HDU 2680 Choose the best route(dij)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83273959</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83273959</guid><author>ccshijtgc</author><pubDate>Mon, 22 Oct 2018 15:50:55 +0800</pubDate><description><![CDATA[Choose the best route


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
const int inf = 100000000;
int n,m,s;
int map[1005][1005];
int vis[1005],cast...]]></description><category></category></item><item><title><![CDATA[HDU 2807 The Shortest Path(floyd)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83273892</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83273892</guid><author>ccshijtgc</author><pubDate>Mon, 22 Oct 2018 15:47:07 +0800</pubDate><description><![CDATA[The Shortest Path


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
#define inf  99999999

int n,m;
int map[85][85];
int a[85][85][85], tem[85][85];
...]]></description><category></category></item><item><title><![CDATA[HDU 1227 Arbitrage（spfa)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83271916</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83271916</guid><author>ccshijtgc</author><pubDate>Mon, 22 Oct 2018 13:58:14 +0800</pubDate><description><![CDATA[Arbitrage


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;map&amp;gt;
#include &amp;lt;queue&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;

const int L = 35;
c...]]></description><category></category></item><item><title><![CDATA[HDU 1548 A strange lift(Dijkstra)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83268849</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83268849</guid><author>ccshijtgc</author><pubDate>Mon, 22 Oct 2018 10:02:07 +0800</pubDate><description><![CDATA[A strange lift


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;

const int inf = 1&amp;lt;&amp;lt;30;

int n;
int map[205][205];
int a[205], cnt;
int vis[20...]]></description><category></category></item><item><title><![CDATA[HDU 2112 today(dij)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83268660</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83268660</guid><author>ccshijtgc</author><pubDate>Mon, 22 Oct 2018 09:50:45 +0800</pubDate><description><![CDATA[HDU Today


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;map&amp;gt;
using namespace std;
#define inf 0x3f3f3f3f

int cast[205], vis[...]]></description><category></category></item><item><title><![CDATA[HDU 3790 最短路径问题 dij]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83268620</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83268620</guid><author>ccshijtgc</author><pubDate>Mon, 22 Oct 2018 09:48:59 +0800</pubDate><description><![CDATA[最短路径问题


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
const int inf = 1&amp;lt;&amp;lt;30;
int n, m;
int map_len[1005][1005], map_time[1005][1005];
int vi...]]></description><category></category></item><item><title><![CDATA[HDU 1874 畅通工程续(spfa)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83178751</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83178751</guid><author>ccshijtgc</author><pubDate>Sat, 20 Oct 2018 10:28:06 +0800</pubDate><description><![CDATA[畅通工程续


#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;queue&amp;gt;
#include &amp;lt;climits&amp;gt;

using namespace std;
const int MAXN = 200+5;
const int MAXM = 1000+5...]]></description><category></category></item><item><title><![CDATA[HDU 2544 最短路（dij)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83181111</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83181111</guid><author>ccshijtgc</author><pubDate>Sat, 20 Oct 2018 10:27:55 +0800</pubDate><description><![CDATA[最短路


#include &amp;lt;bits/stdc++.h&amp;gt;
#include &amp;lt;set&amp;gt;

using namespace std;

const int MAX_N = 10000;
const int MAX_M = 100000;
const int inf = 0x3f3f3f3f;
struct edge {
    int v, w, next;
} e[MA...]]></description><category></category></item><item><title><![CDATA[HDU2066：一个人的旅行（Dijkstra）]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83183110</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83183110</guid><author>ccshijtgc</author><pubDate>Sat, 20 Oct 2018 10:27:46 +0800</pubDate><description><![CDATA[一个人的旅行


#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
const int inf = 1&amp;lt;&amp;lt;30;
 
int T,S,D,n;
int map[1111][1111];
int vis[1111],cast[1111];
i...]]></description><category></category></item><item><title><![CDATA[美好的邂逅(floyd)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83176016</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83176016</guid><author>ccshijtgc</author><pubDate>Fri, 19 Oct 2018 09:00:51 +0800</pubDate><description><![CDATA[美好的邂逅


#include &amp;lt;bits/stdc++.h&amp;gt;

using namespace std;

const int MAXN = 305;
const int INF = 0x3f3f3f3f;
int group1[MAXN];
int group2[MAXN];
int G[MAXN][MAXN];
int n, m, t;

void floyd()
{
    ...]]></description><category></category></item><item><title><![CDATA[蒜头君的训练室（floyd)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83176010</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83176010</guid><author>ccshijtgc</author><pubDate>Fri, 19 Oct 2018 09:00:02 +0800</pubDate><description><![CDATA[蒜头君的训练室


#include &amp;lt;bits/stdc++.h&amp;gt;

using namespace std;

const int MAXN = 305;
const int INF = 0x3f3f3f3f;
int group1[MAXN];
int group2[MAXN];
int G[MAXN][MAXN];
int n, m, t;

void floyd()
{
  ...]]></description><category></category></item><item><title><![CDATA[蒜厂年会（floyd)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83176000</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83176000</guid><author>ccshijtgc</author><pubDate>Fri, 19 Oct 2018 08:58:58 +0800</pubDate><description><![CDATA[蒜厂年会


#include &amp;lt;bits/stdc++.h&amp;gt;

using namespace std;

const int MAXN = 305;
const int INF = 0x3f3f3f3f;
int group1[MAXN];
int group2[MAXN];
int G[MAXN][MAXN];
int n, m;

void floyd()
{
    for(...]]></description><category></category></item><item><title><![CDATA[蒜头君的银行卡（差分）]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83175987</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83175987</guid><author>ccshijtgc</author><pubDate>Fri, 19 Oct 2018 08:57:57 +0800</pubDate><description><![CDATA[蒜头君的银行卡


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cctype&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;cmath&amp;gt;
//#include&amp;lt;set&amp;gt;
//#include&amp;lt;vector&]]></description><category></category></item><item><title><![CDATA[成仙之路(spfa)]]></title><link>https://blog.youkuaiyun.com/ccshijtgc/article/details/83175979</link><guid>https://blog.youkuaiyun.com/ccshijtgc/article/details/83175979</guid><author>ccshijtgc</author><pubDate>Fri, 19 Oct 2018 08:56:43 +0800</pubDate><description><![CDATA[成仙之路


#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;queue&amp;gt;
#include &amp;lt;climits&amp;gt;
int L[200010];
using namespace std;

int MAXN=70000;
int p[70000];
boo...]]></description><category></category></item></channel></rss>