<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[            Saber]]></title><description><![CDATA[Do what you want to Do]]></description><link>https://blog.youkuaiyun.com/think1003</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; think1003]]></copyright><item><title><![CDATA[JSON简介]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/42710847</link><guid>https://blog.youkuaiyun.com/think1003/article/details/42710847</guid><author>think1003</author><pubDate>Wed, 14 Jan 2015 15:50:17 +0800</pubDate><description><![CDATA[参考：http://www.w3cschool.cc/json/json-tutorial.html
    JSON（JavaScript Object Notation）, JS对象表示法。可以简单理解为一种存储数据的格式、规则，用Json形式表示的数据称为Json数据。
    是存储和交换文本信息的语法，类似于XML。
    特点是，能够将JSON数据直接生成JS对象。]]></description><category></category></item><item><title><![CDATA[基数排序简介]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/42710461</link><guid>https://blog.youkuaiyun.com/think1003/article/details/42710461</guid><author>think1003</author><pubDate>Wed, 14 Jan 2015 15:36:19 +0800</pubDate><description><![CDATA[参考：http://www.cnblogs.com/Braveliu/archive/2013/01/21/2870201.html
因为在看后缀数组时需要用到基数排序，所以把基数排序稍微看了下，平时对基数排序用的比较少，也没太关注。。参考中讲得比较详细，包括举例与实现等。这里主要介绍下基数排序的想法以及使用范围。
对于基数排序，一般都是在用于多个关键字排序中，比如说对一组两位数的数字进行排序]]></description><category></category></item><item><title><![CDATA[ASDL, Asymmetric Digital Subscriber Line]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/42365937</link><guid>https://blog.youkuaiyun.com/think1003/article/details/42365937</guid><author>think1003</author><pubDate>Sat, 03 Jan 2015 19:17:11 +0800</pubDate><description><![CDATA[参考：
http://www.pc841.com/article/20110630-3023.html
http://www.pc841.com/article/20120828-7868.html

非对称数字用户线ADSL，因为用户在上网时主要是从因特网下载各种文档，而向因特网发送的信息一般都不太大，因此ADSL的下行（从ISP到用户）带宽都远远大于上行（从用户到ISP）带宽，因此“非]]></description><category></category></item><item><title><![CDATA[POJ 3080 Blue Jeans]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/42365751</link><guid>https://blog.youkuaiyun.com/think1003/article/details/42365751</guid><author>think1003</author><pubDate>Sat, 03 Jan 2015 18:52:41 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=3080
题目描述：
给定多个（2~10）长为60的串，然后求最长公共字串，这里使用的是用DP直接两个两个求，为9 * 60 * 60复杂度，特别注意一点的就是如果是多个长度相同的最长公共字串，输出字典序最小的一个串。
关于最长公共字串可以参照：http://www.ahathinking.com/archives/122.htm]]></description><category></category></item><item><title><![CDATA[POJ 1129 Channel Allocation]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/42365729</link><guid>https://blog.youkuaiyun.com/think1003/article/details/42365729</guid><author>think1003</author><pubDate>Sat, 03 Jan 2015 18:39:38 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1129
题目描述：
这题可以看成就是一个涂色问题，给定一个无向图，节点最多为26个，然后给每个节点涂色，相邻的不能涂相同的颜色，其实就可以对每一个节点开始模拟涂色，1号还是，看是否合适即可。
#include
#include
#include
#include
using namespace std ;

const int ]]></description><category></category></item><item><title><![CDATA[POJ 3414 Pots]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/42101457</link><guid>https://blog.youkuaiyun.com/think1003/article/details/42101457</guid><author>think1003</author><pubDate>Tue, 23 Dec 2014 13:24:06 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=3414
题目描述：
给定三个数A、B、C，表示现有容积为A、B的两个容器，有六种操作，初始状态容器为空，问是否能够经过操作使得中间至少一个容器有C个单位液体。
因为A、B、C的大小均小于100，所以无论能否组成，尝试的最多A、B组合的情况是 100 * 100 ， 求最小的步数，直接BFS即可，可以用哈希判重。找到过，往回输出步]]></description><category></category></item><item><title><![CDATA[POJ 2531 Network Saboteur]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/42101347</link><guid>https://blog.youkuaiyun.com/think1003/article/details/42101347</guid><author>think1003</author><pubDate>Tue, 23 Dec 2014 13:13:21 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=2531
题目描述：
题目大意就是说现有n个节点，（nB中每个节点的权重之和最大。
因为考虑到的是n
#include
#include
#include
using namespace std ;

int num1, res ;
int C[25][25], n ;
bool cc[25] ;
//
int cal(int ]]></description><category></category></item><item><title><![CDATA[POJ 3083 Children of the Candy Corn]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/41289671</link><guid>https://blog.youkuaiyun.com/think1003/article/details/41289671</guid><author>think1003</author><pubDate>Wed, 19 Nov 2014 21:54:37 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=3083
题目分析：]]></description><category></category></item><item><title><![CDATA[POJ 2488 A Knight's Journey]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/41289381</link><guid>https://blog.youkuaiyun.com/think1003/article/details/41289381</guid><author>think1003</author><pubDate>Wed, 19 Nov 2014 21:41:16 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=2488
题目分析：
题目大意就是一个]]></description><category></category></item><item><title><![CDATA[JavaScript学习笔记（四）]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/41089603</link><guid>https://blog.youkuaiyun.com/think1003/article/details/41089603</guid><author>think1003</author><pubDate>Thu, 13 Nov 2014 22:05:51 +0800</pubDate><description><![CDATA[1. 回调函数
   常表现为一个函数中的参数是函数。
   //
	function a(){
		document.write("hello") ;
	}
	function c( b ){
		if( typeof b == "function" ){
			b() ;
		}
	}
	c( a ) ;]]></description><category></category></item><item><title><![CDATA[JavaScript学习笔记（三）]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/41048743</link><guid>https://blog.youkuaiyun.com/think1003/article/details/41048743</guid><author>think1003</author><pubDate>Wed, 12 Nov 2014 19:49:57 +0800</pubDate><description><![CDATA[这次主要是几个需要注意的语句以及]]></description><category></category></item><item><title><![CDATA[JavaScript学习笔记（二）]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/40819065</link><guid>https://blog.youkuaiyun.com/think1003/article/details/40819065</guid><author>think1003</author><pubDate>Wed, 05 Nov 2014 10:34:54 +0800</pubDate><description><![CDATA[这次主要记录的是JavaScript中的类型转化以及三种编码函数。

一、类型转化

　　JavaScript中的类型转化，属于全局对象。]]></description><category></category></item><item><title><![CDATA[JavaScript学习笔记（一）]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/40818977</link><guid>https://blog.youkuaiyun.com/think1003/article/details/40818977</guid><author>think1003</author><pubDate>Wed, 05 Nov 2014 10:31:53 +0800</pubDate><description><![CDATA[准备重新完整的再学下JavaScript，主要还是注意下一些常见的问题，废话少说了。。

1. 加入标签，其中会有两种表现形式：]]></description><category></category></item><item><title><![CDATA[POJ 1088 滑雪]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/40661813</link><guid>https://blog.youkuaiyun.com/think1003/article/details/40661813</guid><author>think1003</author><pubDate>Fri, 31 Oct 2014 21:57:38 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1088]]></description><category></category></item><item><title><![CDATA[POJ 1067 取石子游戏]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/40150937</link><guid>https://blog.youkuaiyun.com/think1003/article/details/40150937</guid><author>think1003</author><pubDate>Thu, 16 Oct 2014 16:53:14 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1067
题目描述：
    中文题，就不多说了，纯未作]]></description><category></category></item><item><title><![CDATA[POJ 1017 Packets]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/40150807</link><guid>https://blog.youkuaiyun.com/think1003/article/details/40150807</guid><author>think1003</author><pubDate>Thu, 16 Oct 2014 16:41:34 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1017
题目描述：
    给定6个数，表示是1*1，2*2....6*6的正方形的个数，现将这些正方形放在6*6的正方形中，问最少需要多少个6*6的正方形。
    出]]></description><category></category></item><item><title><![CDATA[POJ 1016 Numbers That Count]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/40150675</link><guid>https://blog.youkuaiyun.com/think1003/article/details/40150675</guid><author>think1003</author><pubDate>Thu, 16 Oct 2014 16:38:50 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1016]]></description><category></category></item><item><title><![CDATA[CF 212E. IT Restaurants]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/38903613</link><guid>https://blog.youkuaiyun.com/think1003/article/details/38903613</guid><author>think1003</author><pubDate>Thu, 28 Aug 2014 21:05:33 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/problemset/problem/212/E
题目描述：
       个]]></description><category></category></item><item><title><![CDATA[CF 300E Empire Strikes Back]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/38903083</link><guid>https://blog.youkuaiyun.com/think1003/article/details/38903083</guid><author>think1003</author><pubDate>Thu, 28 Aug 2014 20:45:40 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/problemset/problem/300/E]]></description><category></category></item><item><title><![CDATA[CF 178B3  Greedy Merchants]]></title><link>https://blog.youkuaiyun.com/think1003/article/details/38902831</link><guid>https://blog.youkuaiyun.com/think1003/article/details/38902831</guid><author>think1003</author><pubDate>Thu, 28 Aug 2014 20:13:52 +0800</pubDate><description><![CDATA[题目链接：http://codeforces.com/problemset/problem/178/B3]]></description><category></category></item></channel></rss>