<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LOOKATTHATGIRL]]></copyright><item><title><![CDATA[linux一些配置]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/43340991</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/43340991</guid><author>LOOKATTHATGIRL</author><pubDate>Sat, 31 Jan 2015 14:55:56 +0800</pubDate><description><![CDATA[在ubuntu下装上了matlab，熟悉了ln命令，相当于建立快捷方式，又熟悉了.desktop这个文件描述，可以往菜单栏添加图标。]]></description><category></category></item><item><title><![CDATA[Haskell配置]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/42041249</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/42041249</guid><author>LOOKATTHATGIRL</author><pubDate>Sat, 20 Dec 2014 10:51:47 +0800</pubDate><description><![CDATA[最近被一切皆为函数这句话深深吸引，便来到了Haskell的世界。可上手却费了一番周折。
Windows上配置很顺利，环境变量都自动给配置好了。
在Ubuntu14上解压二进制的HaskellPlatform包到我常用的应用程序文件夹里，先是运行./ghci，提示一堆错，cat一下ghci，里面的命令都默认目录是/usr。。于是重新解压到该目录里，似乎这个目录已经在全局的环境变量里了。直接运行g]]></description><category></category></item><item><title><![CDATA[parallel binary search SPOJMeteors]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/40947951</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/40947951</guid><author>LOOKATTHATGIRL</author><pubDate>Sun, 09 Nov 2014 10:52:39 +0800</pubDate><description><![CDATA[题目链接
题目大意：]]></description><category></category></item><item><title><![CDATA[可持久化线段树  CF484E-Sign on Fence]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/40947905</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/40947905</guid><author>LOOKATTHATGIRL</author><pubDate>Sun, 09 Nov 2014 10:38:24 +0800</pubDate><description><![CDATA[题目链接]]></description><category></category></item><item><title><![CDATA[可持久化线段树 HDU4866 Shooting]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/39135091</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/39135091</guid><author>LOOKATTHATGIRL</author><pubDate>Mon, 08 Sep 2014 10:30:05 +0800</pubDate><description><![CDATA[题目链接 
一些平行于x轴的线段作为射击目标，每次在x轴上选一个点向y轴方向射击，可以射中最近的k个目标，得分是射中目标的高度和，求这个得分。
对高度建立函数式线段树，按顺序对x轴坐标建树，维护区间和和区间个数，每次设计询问该线段树即可。

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#incl]]></description><category></category></item><item><title><![CDATA[隐马尔可夫模型(HMM) HDU4865 Peter's Hobby]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/39134647</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/39134647</guid><author>LOOKATTHATGIRL</author><pubDate>Mon, 08 Sep 2014 09:27:10 +0800</pubDate><description><![CDATA[题目链接]]></description><category></category></item><item><title><![CDATA[树的重心DP HDU4863 Centroid of a Tree]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/38827849</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/38827849</guid><author>LOOKATTHATGIRL</author><pubDate>Mon, 25 Aug 2014 22:25:27 +0800</pubDate><description><![CDATA[题目]]></description><category></category></item><item><title><![CDATA[COURSERA Machine Learning WEEK1&&WEEK2]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/37313011</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/37313011</guid><author>LOOKATTHATGIRL</author><pubDate>Sun, 06 Jul 2014 11:08:46 +0800</pubDate><description><![CDATA[WEEK1&&WEEK2
学习了梯度下降算法]]></description><category></category></item><item><title><![CDATA[ubuntu中chrome标签栏等中文显示乱码]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/33830541</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/33830541</guid><author>LOOKATTHATGIRL</author><pubDate>Mon, 23 Jun 2014 23:39:40 +0800</pubDate><description><![CDATA[修改/etc/fonts/conf.d/49-sansserif.conf中最后一个sans-]]></description><category></category></item><item><title><![CDATA[linux(ubuntu)中的命令]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/31009495</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/31009495</guid><author>LOOKATTHATGIRL</author><pubDate>Sun, 15 Jun 2014 22:15:29 +0800</pubDate><description><![CDATA[解压tar.gz文件 
tar -zxvf "]]></description><category></category></item><item><title><![CDATA[推理题 2014 TCO Round 2B 500 SumAndProductPuzzle]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/29379293</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/29379293</guid><author>LOOKATTHATGIRL</author><pubDate>Sun, 08 Jun 2014 18:12:18 +0800</pubDate><description><![CDATA[题目链接]]></description><category></category></item><item><title><![CDATA[AC自动机上的DP CF433E Tachibana Kanade's Tofu]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/28399501</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/28399501</guid><author>LOOKATTHATGIRL</author><pubDate>Wed, 04 Jun 2014 11:09:24 +0800</pubDate><description><![CDATA[题目链接]]></description><category></category></item><item><title><![CDATA[数位DP CF388D - Fox and Perfect Sets]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/28393711</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/28393711</guid><author>LOOKATTHATGIRL</author><pubDate>Wed, 04 Jun 2014 10:27:39 +0800</pubDate><description><![CDATA[一个perfect集合满足性质：任意两个j]]></description><category></category></item><item><title><![CDATA[POJ1523 SPF]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6844146</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6844146</guid><author>LOOKATTHATGIRL</author><pubDate>Tue, 04 Oct 2011 17:36:18 +0800</pubDate><description><![CDATA[题目大意：求无向图的割点.
无向图割点求法：DFS搜索生成树中，如果一个节点的一颗子树的所有节点都不存在到该节点
的祖先的回边，那么该节点为割点。
建立两个数组，dfn[ ], low[ ].dfn[i]代表搜索的次序，low[i]代表该节点（或者该节点所有子孙）通
过回]]></description><category></category></item><item><title><![CDATA[POJ 2585 Window Pains 拓扑排序]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6707453</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6707453</guid><author>LOOKATTHATGIRL</author><pubDate>Mon, 22 Aug 2011 09:42:47 +0800</pubDate><description><![CDATA[题目大意:给出电脑屏幕上的若干窗口图形,窗口关系只能是覆盖和被覆盖,问是否合理.
题解:熟练拓扑排序.
#include
#include
#include
#include
#include
#include
using namespace std;
class Windo]]></description><category></category></item><item><title><![CDATA[POJ 3844 Divisible Subsequences]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6703900</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6703900</guid><author>LOOKATTHATGIRL</author><pubDate>Sat, 20 Aug 2011 11:13:30 +0800</pubDate><description><![CDATA[题目大意:
给出一数列,n
思路:
naive:O(n^2),pass;
key point:
if two partial sums have the same remainder, their difference is divisible by d.
即前i个数]]></description><category></category></item><item><title><![CDATA[生成质数的好方法:sieve of eratosthenes]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6703709</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6703709</guid><author>LOOKATTHATGIRL</author><pubDate>Sat, 20 Aug 2011 10:11:26 +0800</pubDate><description><![CDATA[生成n以内的质数:
易知一个整数最大质因数不会超过其算术平方根,所以只需要从1-n中
剔除1-n^0.5中质数的所有整数倍即可(质数本身除外).
n为一千万时大概只需要0.3秒多. 
bool prim[n];//true为质数
void makeprim()
{]]></description><category></category></item><item><title><![CDATA[POJ 1465 Multiple]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6697248</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6697248</guid><author>LOOKATTHATGIRL</author><pubDate>Thu, 18 Aug 2011 10:39:07 +0800</pubDate><description><![CDATA[题目大意:
给出一个整数M,和若干十进制数字 ,求由这些十进制数字组成的这个整数的最小倍数,
没有的话输出0.
解答:
最原始想法,从小到大枚举每个倍数,果断PASS.
正规想法,用给出的十进制数字由小到大生成一系列数,依次判断是否可行,
key point:由x生成]]></description><category></category></item><item><title><![CDATA[POJ 1094 Sorting It All Out 拓扑排序]]></title><link>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6697165</link><guid>https://blog.youkuaiyun.com/LOOKATTHATGIRL/article/details/6697165</guid><author>LOOKATTHATGIRL</author><pubDate>Thu, 18 Aug 2011 10:08:22 +0800</pubDate><description><![CDATA[题目大意:
给出若干不等式,判断这些不等式是否有冲突,没有冲突的话是否能够成唯一拓扑序列.
解答:
采用拓扑排序即可,拓扑排序可判断图中是否有环.
代码:
#include
#include
#include
#include
using namespace std;]]></description><category></category></item></channel></rss>