<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[NM的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/NMfloat</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; NMfloat]]></copyright><item><title><![CDATA[HDU 1233 还是畅通工程 基础最小生成树]]></title><link>https://blog.csdn.net/NMfloat/article/details/75194556</link><guid>https://blog.csdn.net/NMfloat/article/details/75194556</guid><author>NMfloat</author><pubDate>Sat, 15 Jul 2017 22:34:17 +0800</pubDate><description><![CDATA[传送门
  http://acm.hdu.edu.cn/showproblem.php?pid=1233
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>using namespace std;struct Edge {
public:
    int u;]]></description><category></category></item><item><title><![CDATA[HDU 1232 畅通工程 并查集水题]]></title><link>https://blog.csdn.net/NMfloat/article/details/75194387</link><guid>https://blog.csdn.net/NMfloat/article/details/75194387</guid><author>NMfloat</author><pubDate>Sat, 15 Jul 2017 22:07:28 +0800</pubDate><description><![CDATA[题意并查集算法最后得到的集合的个数减一就是结果传送门
  http://acm.hdu.edu.cn/showproblem.php?pid=1232
#include <cstdio>
#include <cstring>
#include <iostream>using namespace std;class UnionFind {
private:
    int * fa;
    int]]></description><category></category></item><item><title><![CDATA[HDU 1102 Constructing Roads 最小生成树]]></title><link>https://blog.csdn.net/NMfloat/article/details/75194334</link><guid>https://blog.csdn.net/NMfloat/article/details/75194334</guid><author>NMfloat</author><pubDate>Sat, 15 Jul 2017 21:57:46 +0800</pubDate><description><![CDATA[题意最小生成树模板题思路我把sort的cmp函数 e1.dis < e2.dis 写成 e1.dis - e2.dis RE了一下午，SAD传送门
  http://acm.hdu.edu.cn/showproblem.php?pid=1102
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#i]]></description><category></category></item><item><title><![CDATA[HDU 1856 More is better]]></title><link>https://blog.csdn.net/NMfloat/article/details/75151655</link><guid>https://blog.csdn.net/NMfloat/article/details/75151655</guid><author>NMfloat</author><pubDate>Sat, 15 Jul 2017 12:19:26 +0800</pubDate><description><![CDATA[题意求并查集中最大的一个集合的大小思路Union过后，使用Find找到每个节点的祖先统计即可。传送门
  http://acm.hdu.edu.cn/showproblem.php?pid=1856
#include <cstdio>
#include <cstring>
#include <iostream>using namespace std;class UnionFind {
private]]></description><category></category></item><item><title><![CDATA[HDU 1325 Is It A Tree?]]></title><link>https://blog.csdn.net/NMfloat/article/details/75151066</link><guid>https://blog.csdn.net/NMfloat/article/details/75151066</guid><author>NMfloat</author><pubDate>Sat, 15 Jul 2017 11:56:30 +0800</pubDate><description><![CDATA[题意判断一系列的输入是否是一棵树思路比HDU 1272多判断一个入度，如果入度为0的点不止一个，就肯定不是一颗树传送门
  http://acm.hdu.edu.cn/showproblem.php?pid=1325
Code#include <cstdio>
#include <cstring>
#include <iostream>using namespace std;class UnionF]]></description><category></category></item><item><title><![CDATA[HDU 1272 小希的迷宫 并查集]]></title><link>https://blog.csdn.net/NMfloat/article/details/68939066</link><guid>https://blog.csdn.net/NMfloat/article/details/68939066</guid><author>NMfloat</author><pubDate>Fri, 31 Mar 2017 23:56:56 +0800</pubDate><description><![CDATA[题意给出一个图，问这个图是否是一棵树思路首先判断这个图有没有环，这个直接用并查集就可以判断，为此我改进了并查集的模板，然后就是判断这个图是不是一片森林，这个需要记录下有多少个点，如果有n个点，有n-1条边就是一棵树Code#include <cstdio>
#include <cstring>
#include <iostream>using namespace std;class UnionFin]]></description><category></category></item><item><title><![CDATA[HDU 1213 How Many Tables 并查集]]></title><link>https://blog.csdn.net/NMfloat/article/details/68923436</link><guid>https://blog.csdn.net/NMfloat/article/details/68923436</guid><author>NMfloat</author><pubDate>Fri, 31 Mar 2017 11:44:49 +0800</pubDate><description><![CDATA[题意n个点，m条边，无向图，求最后形成的集合有多少个。解法基础的并查集传送门
  http://acm.hdu.edu.cn/showproblem.php?pid=1213
Code#include <cstdio>
#include <iostream>using namespace std;class UnionFind {
private:
    int * fa;
    int siz]]></description><category></category></item><item><title><![CDATA[SICP 习题2.61~2.62 排序表示的adjoin和union-set函数]]></title><link>https://blog.csdn.net/NMfloat/article/details/51997782</link><guid>https://blog.csdn.net/NMfloat/article/details/51997782</guid><author>NMfloat</author><pubDate>Fri, 22 Jul 2016 19:14:02 +0800</pubDate><description><![CDATA[adjoin函数要注意的是怎样把x插入当前的序列，union-set的写法可以参考书上给出的intersection-set。my.scm文件将给出一些所有代码经常会用到的逻辑。譬如这次的先换行后打印my.scm(define (out x)
  (newline)
  (display x))2.62.scm(load "my.scm")(define (element-of-set? x set]]></description><category></category></item><item><title><![CDATA[SICP 习题2.60 允许元素重复，重构集合操作]]></title><link>https://blog.csdn.net/NMfloat/article/details/51995171</link><guid>https://blog.csdn.net/NMfloat/article/details/51995171</guid><author>NMfloat</author><pubDate>Fri, 22 Jul 2016 15:14:17 +0800</pubDate><description><![CDATA[element-of-set? 和intersection-set的复杂度急剧上升，而adjoin-set和union-set的复杂度下降了一个O(n)O(n)。在adjoin-set操作和union-set操作比较多，element-of-set?和intersection-set操作比较少的时候(define (element-of-set? x set)
  (cond ((null? set]]></description><category></category></item><item><title><![CDATA[SICP 习题2.59 union-set操作]]></title><link>https://blog.csdn.net/NMfloat/article/details/51994800</link><guid>https://blog.csdn.net/NMfloat/article/details/51994800</guid><author>NMfloat</author><pubDate>Fri, 22 Jul 2016 14:49:17 +0800</pubDate><description><![CDATA[union-set操作的想法就是找出set1中set2里面没有的，set2中没有的和set2放在一起，就是union-set(define (element-of-set? x set)
  (cond ((null? set) false)
        ((equal? x (car set)) true)
        (else (element-of-set? x (cdr set))]]></description><category></category></item><item><title><![CDATA[QT PySide 连连看小游戏]]></title><link>https://blog.csdn.net/NMfloat/article/details/51926604</link><guid>https://blog.csdn.net/NMfloat/article/details/51926604</guid><author>NMfloat</author><pubDate>Sat, 16 Jul 2016 21:50:00 +0800</pubDate><description><![CDATA[学了PySide，花了一天时间做出了以前很想写的一个游戏，然后写完主体的逻辑之后就不想再接着往下写了。在windows下写的6*6的方格，总共6种图像，网上找的6张gif图片，然后把大小用windows的画图变成50*50像素的图像，这是点击之前的图像。然后把gif图中白色的像素涂黑变成点击之后的图像（这个也是用windows画图解决的）。刚接触python，感觉格式会很好，但是self这个有点不爽]]></description><category></category></item><item><title><![CDATA[SICP 习题2.53~2.55 equal]]></title><link>https://blog.csdn.net/NMfloat/article/details/51803816</link><guid>https://blog.csdn.net/NMfloat/article/details/51803816</guid><author>NMfloat</author><pubDate>Fri, 01 Jul 2016 19:09:18 +0800</pubDate><description><![CDATA[2.55 : ‘被替换成了(quote)(define (memq item x)
  (cond ((null? x) false)
        ((eq? item (car x)) x)
        (else (memq item (cdr x)))))(newline)
(display (list 'a 'b 'c))(newline)
(display (list (list]]></description><category></category></item><item><title><![CDATA[SICP 习题2.43 八皇后问题flatmap嵌套反了]]></title><link>https://blog.csdn.net/NMfloat/article/details/51794494</link><guid>https://blog.csdn.net/NMfloat/article/details/51794494</guid><author>NMfloat</author><pubDate>Fri, 01 Jul 2016 00:38:53 +0800</pubDate><description><![CDATA[问题在于(queen-cols (- k 1))被执行过多次了，在之前2.42的里面(queen-cols (-k 1))只执行了一次棋盘大小是NN时，运行时间是T∗NNT*N^N，因为在每一层（queen-cols (- k 1))都要被执行N次，一共有N层。]]></description><category></category></item><item><title><![CDATA[SICP 习题2.42 八皇后问题]]></title><link>https://blog.csdn.net/NMfloat/article/details/51794477</link><guid>https://blog.csdn.net/NMfloat/article/details/51794477</guid><author>NMfloat</author><pubDate>Fri, 01 Jul 2016 00:24:58 +0800</pubDate><description><![CDATA[想不到第一次写八皇后问题是用的scm写代码的途中遇到一个错误，用let错了，用define对了，应该是编译器的原因，和nil差不多。(define (accumulate op initial sequence)
  (if (null? sequence)
    initial
    (op (car sequence)
        (accumulate op initial (cdr]]></description><category></category></item><item><title><![CDATA[SICP 习题2.41 triple 三元组]]></title><link>https://blog.csdn.net/NMfloat/article/details/51786138</link><guid>https://blog.csdn.net/NMfloat/article/details/51786138</guid><author>NMfloat</author><pubDate>Wed, 29 Jun 2016 21:38:55 +0800</pubDate><description><![CDATA[非常朴素的想法，找出所有的三元组，然后判定三元组的和是否与s相等(define (accumulate op initial sequence)
  (if (null? sequence)
    initial
    (op (car sequence)
        (accumulate op initial (cdr sequence)))))(define (enumerate-in]]></description><category></category></item><item><title><![CDATA[SICP 练习2.40 unique-pairs]]></title><link>https://blog.csdn.net/NMfloat/article/details/51785456</link><guid>https://blog.csdn.net/NMfloat/article/details/51785456</guid><author>NMfloat</author><pubDate>Wed, 29 Jun 2016 19:47:21 +0800</pubDate><description><![CDATA[我所做的只是把unique-pairs封装了一下(define (accumulate op initial sequence)
  (if (null? sequence)
    initial
    (op (car sequence)
        (accumulate op initial (cdr sequence)))))(define (enumerate-interval l]]></description><category></category></item><item><title><![CDATA[SICP 习题2.39 reverse实现]]></title><link>https://blog.csdn.net/NMfloat/article/details/51755109</link><guid>https://blog.csdn.net/NMfloat/article/details/51755109</guid><author>NMfloat</author><pubDate>Fri, 24 Jun 2016 18:40:07 +0800</pubDate><description><![CDATA[(define reverse-list 
  (lambda (s)
    (if (null? s)
      '()
      (append (reverse-list (cdr s)) (list (car s))))))(newline)
(display (reverse-list '(1 2 3 4))) (newline)
(display (reverse '(1 2 3]]></description><category></category></item><item><title><![CDATA[SICP 习题2.38 fold-left fold-right]]></title><link>https://blog.csdn.net/NMfloat/article/details/51754752</link><guid>https://blog.csdn.net/NMfloat/article/details/51754752</guid><author>NMfloat</author><pubDate>Fri, 24 Jun 2016 17:39:59 +0800</pubDate><description><![CDATA[要使fold-left和fold-right达到同样的结果，要求op对操作顺序无关，譬如+(define (accumulate op initial sequence)
  (if (null? sequence)
    initial
    (op (car sequence)
        (accumulate op initial (cdr sequence)))))(define]]></description><category></category></item><item><title><![CDATA[SICP 习题2.37 矩阵乘法的一些实现]]></title><link>https://blog.csdn.net/NMfloat/article/details/51754610</link><guid>https://blog.csdn.net/NMfloat/article/details/51754610</guid><author>NMfloat</author><pubDate>Fri, 24 Jun 2016 17:24:36 +0800</pubDate><description><![CDATA[(define (accumulate op initial sequence)
  (if (null? sequence)
    initial
    (op (car sequence)
        (accumulate op initial (cdr sequence)))))(define (accumulate-n op init seqs)
  (if (null? (car]]></description><category></category></item><item><title><![CDATA[SICP 习题2.36 accumulate-n的实现]]></title><link>https://blog.csdn.net/NMfloat/article/details/51754596</link><guid>https://blog.csdn.net/NMfloat/article/details/51754596</guid><author>NMfloat</author><pubDate>Fri, 24 Jun 2016 17:22:36 +0800</pubDate><description><![CDATA[(define (accumulate op initial sequence)
  (if (null? sequence)
    initial
    (op (car sequence)
        (accumulate op initial (cdr sequence)))))(define (accumulate-n op init seqs)
  (if (null? (car]]></description><category></category></item></channel></rss>