<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hellohelloC的博客]]></title><description><![CDATA[一个真正强大的人，不会把太多心思花在取悦和亲附别人上面。所谓圈子、资源，都只是衍生品。最重要的是提高自己的内功。只有自己修炼好了，才会有别人来亲附。自己是梧桐，凤凰才会来栖；自己是大海，百川才来汇聚，]]></description><link>https://blog.youkuaiyun.com/hellohelloC</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hellohelloC]]></copyright><item><title><![CDATA[链表六大解题套路（快慢双指针大法）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/123152264</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/123152264</guid><author>hellohelloC</author><pubDate>Sat, 26 Feb 2022 16:50:30 +0800</pubDate><description><![CDATA[链表解题总结]]></description><category></category></item><item><title><![CDATA[浅谈lua脚本类装饰器装饰器]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/79230837</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/79230837</guid><author>hellohelloC</author><pubDate>Thu, 01 Feb 2018 17:37:59 +0800</pubDate><description><![CDATA[最近刚进公司不久，学习了脚本语言Lua，今天重新理解了下装饰器，感觉蛮简单的，就是把一个函数的功能稍微修饰下。
1、先看这个简单程序，求几个数的最大值。
local function my_max( ... )
	return math.max( ... )
end

print(my_max(1,2,3))2、假设输入的值不是村数字的话，这时候应该报错，那该怎么实现呢
local func]]></description><category></category></item><item><title><![CDATA[TCP三次握手和四次握手]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/78237718</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/78237718</guid><author>hellohelloC</author><pubDate>Sat, 14 Oct 2017 22:48:51 +0800</pubDate><description><![CDATA[TCP是什么？
具体的关于TCP是什么，我不打算详细的说了；当你看到这篇文章时，我想你也知道TCP的概念了，想要更深入的了解TCP的工作，我们就继续。它只是一个超级麻烦的协议，而它又是互联网的基础，也是每个程序员必备的基本功。首先来看看OSI的七层模型：
 我们需要知道TCP工作在网络OSI的七层模型中的第四层——Transport层，IP在第三层——Network层，ARP在第二层——Dat]]></description><category></category></item><item><title><![CDATA[排序]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/65936190</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/65936190</guid><author>hellohelloC</author><pubDate>Sat, 25 Mar 2017 13:55:59 +0800</pubDate><description><![CDATA[排序有很多种，以下介绍几种常用的，效率比较高的： 


快排：

快排是对起泡排序的一种改进，它的基本思想是，通过一趟排序将待排序元素分割成以关键字为中点独立的两个部分，其中一部分比关键字都小，另外一部分比关键字都大，然后下一轮对两部分再以同样的思路进行排序，直到所有的都排序完成。

一趟快速排序具体实现方法如下：假设两边指针为left跟right，初始值分别为a[left],a[r]]></description><category></category></item><item><title><![CDATA[CF Destroying Array（容器的使用）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52751590</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52751590</guid><author>hellohelloC</author><pubDate>Fri, 07 Oct 2016 20:39:49 +0800</pubDate><description><![CDATA[Destroying Array

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

You are given an array consisting of n non-negative int]]></description><category></category></item><item><title><![CDATA[http://codeforces.com/contest/721/problem/C Journey(DAG上的dp)]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52746384</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52746384</guid><author>hellohelloC</author><pubDate>Thu, 06 Oct 2016 23:45:38 +0800</pubDate><description><![CDATA[Journey

time limit per test
3 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output

Recently Irina arrived to one of the most famous cities of Berl]]></description><category></category></item><item><title><![CDATA[树状数组模板]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52728149</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52728149</guid><author>hellohelloC</author><pubDate>Mon, 03 Oct 2016 15:10:57 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;
int a[100],n,m;
int lowbit(int x)
{
    return x&(-x);
}
void add(int pos,int x)
{
    while(pos<=n){
        a[pos]+=x;
        pos+=]]></description><category></category></item><item><title><![CDATA[HDU  5901 Count primes]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52607154</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52607154</guid><author>hellohelloC</author><pubDate>Wed, 21 Sep 2016 14:03:13 +0800</pubDate><description><![CDATA[Count primes
Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 977    Accepted Submission(s): 524



Problem Description

Easy question!]]></description><category></category></item><item><title><![CDATA[HDU 5876 Sparse Graph(补图+BFS最短路）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52503093</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52503093</guid><author>hellohelloC</author><pubDate>Sun, 11 Sep 2016 11:54:41 +0800</pubDate><description><![CDATA[Sparse Graph
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 617    Accepted Submission(s): 210



Problem Description

In graph theo]]></description><category></category></item><item><title><![CDATA[HDU 4445 Running Rabbits（模拟）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52245046</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52245046</guid><author>hellohelloC</author><pubDate>Fri, 19 Aug 2016 00:21:23 +0800</pubDate><description><![CDATA[Running Rabbits
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1792    Accepted Submission(s): 1257



Problem Description

Rabbit Tom]]></description><category></category></item><item><title><![CDATA[HDU 4451 Dressing（计数）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52244976</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52244976</guid><author>hellohelloC</author><pubDate>Thu, 18 Aug 2016 21:20:50 +0800</pubDate><description><![CDATA[Dressing
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3807    Accepted Submission(s): 1722



Problem Description

Wangpeng has N cl]]></description><category></category></item><item><title><![CDATA[HDU 1421 搬寝室(DP)]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52221991</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52221991</guid><author>hellohelloC</author><pubDate>Tue, 16 Aug 2016 15:58:29 +0800</pubDate><description><![CDATA[搬寝室
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25567    Accepted Submission(s): 8783



Problem Description

搬寝室是很累的,xhd深有体会.时间追述2]]></description><category></category></item><item><title><![CDATA[HDU 2089 不要62（数位DP）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52203763</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52203763</guid><author>hellohelloC</author><pubDate>Sun, 14 Aug 2016 11:56:54 +0800</pubDate><description><![CDATA[不要62
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 31495    Accepted Submission(s): 11146



Problem Description

杭州人称那些傻乎乎粘嗒嗒的人为62（音]]></description><category></category></item><item><title><![CDATA[Codeforces Round #367 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52189007</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52189007</guid><author>hellohelloC</author><pubDate>Fri, 12 Aug 2016 10:16:50 +0800</pubDate><description><![CDATA[A. Beru-taxi

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output


Vasiliy lives at point (a, b) of the coordinate plane. He]]></description><category></category></item><item><title><![CDATA[HDU 3234 Exclusive-OR（加权并差集）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52187236</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52187236</guid><author>hellohelloC</author><pubDate>Thu, 11 Aug 2016 22:31:03 +0800</pubDate><description><![CDATA[Exclusive-OR
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3300    Accepted Submission(s): 909



Problem Description

You are not gi]]></description><category></category></item><item><title><![CDATA[HDU 3236 Gift Hunting（0-1背包变异）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52187147</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52187147</guid><author>hellohelloC</author><pubDate>Thu, 11 Aug 2016 22:26:14 +0800</pubDate><description><![CDATA[Gift Hunting
Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1743    Accepted Submission(s): 581



Problem Description

After winning ]]></description><category></category></item><item><title><![CDATA[CSU 1116: Kingdoms(状态压缩+DP)]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52157742</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52157742</guid><author>hellohelloC</author><pubDate>Tue, 09 Aug 2016 01:22:28 +0800</pubDate><description><![CDATA[Kingdoms
Time Limit: 3 Sec  Memory Limit:
64 MB
Submit: 410  Solved: 127
[Submit][Status][Web
 Board]
Description

A kingdom has n cities numbered 1 to n, and some bidirectional roads connecti]]></description><category></category></item><item><title><![CDATA[数列上的分治（求逆序数）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52143832</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52143832</guid><author>hellohelloC</author><pubDate>Sun, 07 Aug 2016 17:52:38 +0800</pubDate><description><![CDATA[在网上看，逆序数可以有线段树解决，我不太清楚，不过最近我在学习如何用分治处理逆序数问题。
大家看看代码吧，看完估计就懂了（如果还不懂去看下分治排序，逆序数问题是在其基础之上的）


#include
#include
#include
#include
#include
#include
using namespace std;
vector A;
int merge_count(vect]]></description><category></category></item><item><title><![CDATA[POJ Evil Straw Warts Live (贪心）]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52143816</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52143816</guid><author>hellohelloC</author><pubDate>Sun, 07 Aug 2016 17:48:34 +0800</pubDate><description><![CDATA[Evil Straw Warts Live




Time Limit: 2000MS


Memory Limit: 65536K


Total Submissions: 850


Accepted: 239





Description
A palindrome is a string of symbols that is equal to ]]></description><category></category></item><item><title><![CDATA[POJ 3258 River Hopscotch（二分·最小距离最大)]]></title><link>https://blog.youkuaiyun.com/hellohelloC/article/details/52120604</link><guid>https://blog.youkuaiyun.com/hellohelloC/article/details/52120604</guid><author>hellohelloC</author><pubDate>Thu, 04 Aug 2016 16:43:22 +0800</pubDate><description><![CDATA[River Hopscotch




Time Limit: 2000MS


Memory Limit: 65536K


Total Submissions: 11580


Accepted: 4985




Description

Every year the cows hold an event featuring a peculiar v]]></description><category></category></item></channel></rss>