https://blog.youkuaiyun.com/lovefqingzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lovefqing/article/details/44903993https://blog.youkuaiyun.com/lovefqing/article/details/44903993lovefqingMon, 06 Apr 2015 18:05:36 +0800https://blog.youkuaiyun.com/lovefqing/article/details/44803707https://blog.youkuaiyun.com/lovefqing/article/details/44803707lovefqingWed, 01 Apr 2015 10:44:50 +0800https://blog.youkuaiyun.com/lovefqing/article/details/8516536https://blog.youkuaiyun.com/lovefqing/article/details/8516536lovefqingFri, 18 Jan 2013 16:45:37 +0800https://blog.youkuaiyun.com/lovefqing/article/details/8289851https://blog.youkuaiyun.com/lovefqing/article/details/8289851lovefqingThu, 13 Dec 2012 15:26:30 +0800https://blog.youkuaiyun.com/lovefqing/article/details/8270123https://blog.youkuaiyun.com/lovefqing/article/details/8270123lovefqingThu, 13 Dec 2012 11:08:35 +0800https://blog.youkuaiyun.com/lovefqing/article/details/8270111https://blog.youkuaiyun.com/lovefqing/article/details/8270111lovefqingTue, 11 Dec 2012 19:52:38 +0800https://blog.youkuaiyun.com/lovefqing/article/details/8268397https://blog.youkuaiyun.com/lovefqing/article/details/8268397lovefqingFri, 07 Dec 2012 13:54:53 +0800https://blog.youkuaiyun.com/lovefqing/article/details/8255846https://blog.youkuaiyun.com/lovefqing/article/details/8255846lovefqingTue, 04 Dec 2012 19:57:40 +0800https://blog.youkuaiyun.com/lovefqing/article/details/8251587https://blog.youkuaiyun.com/lovefqing/article/details/8251587lovefqingTue, 04 Dec 2012 16:14:06 +0800https://blog.youkuaiyun.com/lovefqing/article/details/7568533https://blog.youkuaiyun.com/lovefqing/article/details/7568533lovefqingTue, 15 May 2012 15:26:03 +0800https://blog.youkuaiyun.com/lovefqing/article/details/7399221https://blog.youkuaiyun.com/lovefqing/article/details/7399221lovefqingTue, 27 Mar 2012 15:41:54 +0800https://blog.youkuaiyun.com/lovefqing/article/details/7398602https://blog.youkuaiyun.com/lovefqing/article/details/7398602lovefqingTue, 27 Mar 2012 15:22:40 +0800https://blog.youkuaiyun.com/lovefqing/article/details/7254688https://blog.youkuaiyun.com/lovefqing/article/details/7254688lovefqingMon, 13 Feb 2012 14:41:00 +0800https://blog.youkuaiyun.com/lovefqing/article/details/6724449https://blog.youkuaiyun.com/lovefqing/article/details/6724449lovefqingSat, 27 Aug 2011 12:50:33 +0800https://blog.youkuaiyun.com/lovefqing/article/details/6255997https://blog.youkuaiyun.com/lovefqing/article/details/6255997lovefqingThu, 17 Mar 2011 13:35:00 +0800创建一个MapActivity=>在地图上添加自定义图层一.如何获得Maps API Key？1.在命令行里用keyt]]>https://blog.youkuaiyun.com/lovefqing/article/details/6239777https://blog.youkuaiyun.com/lovefqing/article/details/6239777lovefqingFri, 11 Mar 2011 12:53:00 +0800写一个函数 BOOL Grep(char *strRef, char *strSub);实现如下功能

判断一个字符串 strRef 里面是否存在这样一个子串 strSub:
1.strSub是strRef的起始子串。或是
2.strSub的前一个字符不是0-9,a-z,A-Z中的任何一个字符。
比如：
1.strSub = "jalan"
  strRef = "jalan dusan"
  Grep(strRe]]>https://blog.youkuaiyun.com/lovefqing/article/details/6128462https://blog.youkuaiyun.com/lovefqing/article/details/6128462lovefqingTue, 11 Jan 2011 10:44:00 +0800https://blog.youkuaiyun.com/lovefqing/article/details/6080527https://blog.youkuaiyun.com/lovefqing/article/details/6080527lovefqingThu, 16 Dec 2010 17:06:00 +0800https://blog.youkuaiyun.com/lovefqing/article/details/6077460https://blog.youkuaiyun.com/lovefqing/article/details/6077460lovefqingWed, 15 Dec 2010 13:21:00 +0800https://blog.youkuaiyun.com/lovefqing/article/details/5963828https://blog.youkuaiyun.com/lovefqing/article/details/5963828lovefqingMon, 25 Oct 2010 12:54:00 +0800转载：http://apps.hi.baidu.com/share/detail/17506254
 

       求最短路径的算法有许多种，除了排序外，恐怕是OI界中解决同一类问题算法最多的了。最熟悉的无疑是Dijkstra，接着是Bellman-Ford，它们都可以求出由一个源点向其他各点的最短路径；如果我们想要求出每一对顶点之间的最短路径的话，还可以用Floyd-Warshall。
       SPFA是这篇日志要写的一种算法，它的性能非常好，]]>