https://blog.youkuaiyun.com/lhfcwszh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lhfcws/article/details/8918111https://blog.youkuaiyun.com/lhfcws/article/details/8918111lhfcwsSun, 12 May 2013 21:34:43 +0800https://blog.youkuaiyun.com/lhfcws/article/details/8783553https://blog.youkuaiyun.com/lhfcws/article/details/8783553lhfcwsWed, 10 Apr 2013 16:17:22 +0800https://blog.youkuaiyun.com/lhfcws/article/details/8637490https://blog.youkuaiyun.com/lhfcws/article/details/8637490lhfcwsTue, 05 Mar 2013 13:25:09 +0800https://blog.youkuaiyun.com/lhfcws/article/details/7213618https://blog.youkuaiyun.com/lhfcws/article/details/7213618lhfcwsSat, 21 Jan 2012 20:55:26 +0800 b 0) + -) a b) 运算符可做为复合表达式的组成部分。 中文版中写“复合表达式的组合式”表述不准确，根据搜索，发现复合表达式就是组合式，原文应该是想表达composition组成部分的意思。 1.5      (define (p) (p)]]>https://blog.youkuaiyun.com/lhfcws/article/details/6186991https://blog.youkuaiyun.com/lhfcws/article/details/6186991lhfcwsTue, 15 Feb 2011 23:05:00 +0800题外话：这题做了我好久。。不过也同时把动态和静态的线段树写了一两次。。练了手。。过段时间看完区间加法回来学写二维的，            mark soj 1045
思路：一看到RMQ问题心情澎湃激动就想着sparce table能不能套~~算计了一下。。发现ST算法此处貌似不可行。。也就是说我必须去学线段树（interval tree）。。于是看了一些简陋的资料理解了之后就开始写了。。先写了个动态指针的。。很果断MLE了。。于是迅速改静态用数组的，结果持续tle。。
我原]]>https://blog.youkuaiyun.com/lhfcws/article/details/6186646https://blog.youkuaiyun.com/lhfcws/article/details/6186646lhfcwsTue, 15 Feb 2011 19:08:00 +0800https://blog.youkuaiyun.com/lhfcws/article/details/6176086https://blog.youkuaiyun.com/lhfcws/article/details/6176086lhfcwsWed, 09 Feb 2011 21:42:00 +0800https://blog.youkuaiyun.com/lhfcws/article/details/6174364https://blog.youkuaiyun.com/lhfcws/article/details/6174364lhfcwsTue, 08 Feb 2011 10:54:00 +0800思路：d[i][j][k]=Zigma{d[i][p][k-1]}   d[i][j][k]表示从i到j长度为k的路径数。方程很简单，题目太水，直接三次方复杂度就能过了。
反思：我记得原来貌似是09省赛见过这题，不记得有没改，但我记得没那么水的！貌似当初评委提到过DAG。。但是这明显没关系啊。。做完看了一下别人的做法，看到有dfs实现的（当然不是纯dfs），不过方程应该也是一样。]]>https://blog.youkuaiyun.com/lhfcws/article/details/6173097https://blog.youkuaiyun.com/lhfcws/article/details/6173097lhfcwsSat, 05 Feb 2011 23:41:00 +0800