<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[FOCE CODING]]></title><description><![CDATA[On the way of Coder ...]]></description><link>https://blog.youkuaiyun.com/sonpking</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sonpking]]></copyright><item><title><![CDATA[mac terminal 命令]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/82499975</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/82499975</guid><author>sonpking</author><pubDate>Fri, 07 Sep 2018 17:22:29 +0800</pubDate><description><![CDATA[终端命令

一. 启动,关机,登入,登出相关命令

&amp;lt;login&amp;gt; 登录

&amp;lt;logout&amp;gt; 登出

&amp;lt;exit&amp;gt; 登出

&amp;lt;shutdown&amp;gt; 停止系统

&amp;lt;halt&amp;gt; 停止系统

&amp;lt;reboot&amp;gt; 重启动

&amp;lt;poweroff&amp;gt; 切断电源

&amp;lt;sync&amp;gt; 把内存里的内容写入磁盘

&]]></description><category></category></item><item><title><![CDATA[BBR加速及错误处理]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/79981060</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/79981060</guid><author>sonpking</author><pubDate>Tue, 17 Apr 2018 21:37:52 +0800</pubDate><description><![CDATA[ 

一、升级内核

Google 开源了其TCP BBR 拥塞控制算法，并提交到了Linux内核，从4.9 开始，Linux 内核已经用上了该算法。根据实地测试，在部署了最新版内核并开启了TCP BBR 的机器上，网速甚至可以提升好几个数量级。

使用root用户登录，运行以下命令：（搬自秋水逸冰）

wget --no-check-certificate https://github.com/...]]></description><category></category></item><item><title><![CDATA[HostMyBytes]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/79024958</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/79024958</guid><author>sonpking</author><pubDate>Wed, 10 Jan 2018 16:02:52 +0800</pubDate><description><![CDATA[ 

推荐配置：Hostmybytes KVM VPS 512MB RAM(SS+BBR加速几乎不占用内存，三四个小站没问题）.

Budget VPS Hosting Packages:

Locations available in: Los Angeles and London UK!

128MB RAM VPS - $6/year
	768MB RAM VPS - ... CLICK L...]]></description><category></category></item><item><title><![CDATA[pat1010]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77949654</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77949654</guid><author>sonpking</author><pubDate>Tue, 12 Sep 2017 21:05:01 +0800</pubDate><description><![CDATA[radix数值比较大。不能暴力，即使在二分搜索的时候也要注意，radix很大，计算可能会出现负数，那么比大小恰恰得到相反的结果，二分的结果就会Impossible。
#include
#include
using namespace std;
typedef long long ll;


ll cton(char c){
    if('0'<=c&&c<='9') return c-'0';]]></description><category></category></item><item><title><![CDATA[pat1016]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77947596</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77947596</guid><author>sonpking</author><pubDate>Tue, 12 Sep 2017 17:26:37 +0800</pubDate><description><![CDATA[题目非常繁琐，不过活用数据结构和注意细节处理，就不难解出。注意：若某用户没有任何匹配信息，则不要输出。这是pat惯例，题意模棱两可。
For each test case, you must print a phone bill for each customer.真的each customer吗？？？

#include
#include
#include
#include
using n]]></description><category></category></item><item><title><![CDATA[pat1014]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927709</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927709</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:20:44 +0800</pubDate><description><![CDATA[#include

using namespace std;

int main()
{
    int k;
    while(scanf("%d",&k)!=EOF){
        int floor,pre=0,sum=0;
        for(int i=0;i<k;i++)
        {
            scanf("%d",&floor);]]></description><category></category></item><item><title><![CDATA[pat1008]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927706</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927706</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:20:03 +0800</pubDate><description><![CDATA[#include

using namespace std;

int main()
{
    int k;
    while(scanf("%d",&k)!=EOF){
        int floor,pre=0,sum=0;
        for(int i=0;i<k;i++)
        {
            scanf("%d",&floor);
          ]]></description><category></category></item><item><title><![CDATA[pat1007]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927704</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927704</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:19:33 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
const int maxn=10000+10;
int first,last,maxx;

int main()
{
    int k,d,sum,cur_f;
    while(scanf("%d",&k)==1){
            scanf("%d",&d);
            maxx=fir]]></description><category></category></item><item><title><![CDATA[pat1006]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927701</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927701</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:19:04 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
const int maxn=20;
string first_id,last_id;
int first_time,last_time;

int convert(string str){
    int num=0;
    num+=((str[0]-'0')*10+str[1]-'1')*3600;
    nu]]></description><category></category></item><item><title><![CDATA[pat1005]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927700</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927700</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:18:34 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
string num[]={
    "zero","one","two","three","four",
    "five","six","seven","eight","nine"
};

int compute(string str){
    int sum=0;
    for(int i=]]></description><category></category></item><item><title><![CDATA[pat1004]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927698</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927698</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:18:03 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
using namespace std;
const int maxn=105;

vector tree[maxn];
int layer[maxn],maxly;

void dfs(int node,int ly)
{
    maxly=max(ly,maxly);
    if(tree[node].size()==]]></description><category></category></item><item><title><![CDATA[pat1003]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927690</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927690</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:17:07 +0800</pubDate><description><![CDATA[...
#include
#include
#include
#include
#include
using namespace std;
const int maxn=510;
int peo[maxn],dis[maxn],vis[maxn];
int N,M,c1,c2,route[maxn],sum[maxn];

struct Node{
    int t, w;
    bool ]]></description><category></category></item><item><title><![CDATA[pat1001]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/77927592</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/77927592</guid><author>sonpking</author><pubDate>Mon, 11 Sep 2017 00:06:10 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;


struct Node{
    int exp;
    float value;
};
stack q1,q2,q3;

int main()
{
    int k,exp;
    float value;
    while(scanf("%d",&k)!=EOF){
        for(int i=0]]></description><category></category></item><item><title><![CDATA[【清晰明了】A局域网主机向B局域网主机传输数据的过程]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/76718749</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/76718749</guid><author>sonpking</author><pubDate>Sat, 05 Aug 2017 14:56:07 +0800</pubDate><description><![CDATA[这是个纠结了半年的问题！
局域网A:
1、主机A的应用程序先生成应用层数据;
2、传输层根据应用层协议类型，对应用层数据进行TCP或UDP封装;
3、网络层对数据进行封装时，IP头中的源IP地址填写主机A的IP地址，目的IP填写主机B的外网IP地址(因为只有全球IP地址才能接入互联网，外网地址有限，局域网内的主机需要共享外网地址,B的外网地址就是映射后的外网地址。根据NAT地址转换的规则，]]></description><category></category></item><item><title><![CDATA[POJ-2387]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/75136967</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/75136967</guid><author>sonpking</author><pubDate>Fri, 14 Jul 2017 21:40:32 +0800</pubDate><description><![CDATA[堆实现Dijkstra]]></description><category></category></item><item><title><![CDATA[计算机会议排名等级]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/72808765</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/72808765</guid><author>sonpking</author><pubDate>Tue, 30 May 2017 10:11:30 +0800</pubDate><description><![CDATA[原文地址
计算机领域的学术会议等级排名情况，分为A+, A, B, C, L 共5个档次。其中A+属于顶级会议，基本是这个领域全世界大牛们参与和关注最多的会议。国内的研究者能在其中发表论文的话，是很值得骄傲的成就。


A类也是非常好的会议了，尤其是一些热门的研究方向，A类的会议投稿多录用率低，部分A类会议影响力逐步逼近A+类会议。B类的会议分两种，一种称为盛会级，参与的人多，发表的论文也]]></description><category></category></item><item><title><![CDATA[数据结构set：POJ1065--Wooden Sticks]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/52239695</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/52239695</guid><author>sonpking</author><pubDate>Thu, 18 Aug 2016 12:02:43 +0800</pubDate><description><![CDATA[set是STL中的最常用的结构之一，是采用了红黑树的平衡二叉树的数据结构。]]></description><category></category></item><item><title><![CDATA[多重部分和（DP）：POJ1742--Coins]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/52234759</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/52234759</guid><author>sonpking</author><pubDate>Wed, 17 Aug 2016 21:19:34 +0800</pubDate><description><![CDATA[本文主要探究DP中经典的多重部分和问题，有很多技巧，相信你会有所收获。]]></description><category></category></item><item><title><![CDATA[初识动归（DP）：POJ3176--Cow Bowling]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/52232418</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/52232418</guid><author>sonpking</author><pubDate>Wed, 17 Aug 2016 16:51:47 +0800</pubDate><description><![CDATA[本文初步接触动态规划的有关问题，希望读者对动归有个基本的印象。]]></description><category></category></item><item><title><![CDATA[初识贪心：POJ2393--Yogurt factory]]></title><link>https://blog.youkuaiyun.com/sonpking/article/details/52231566</link><guid>https://blog.youkuaiyun.com/sonpking/article/details/52231566</guid><author>sonpking</author><pubDate>Wed, 17 Aug 2016 15:42:36 +0800</pubDate><description><![CDATA[本文带领大家初识贪心算法，一般而言贪心算法的效率较高。]]></description><category></category></item></channel></rss>