算法(第四版）答案 1.5案例研究

1.5.1

1.5.2

1.5.3

1.5.4

1.5.7

#pragma once
class QuickFindUF
{
private:
	int* id;
	int arraySize;
	int count;
public:
	QuickFindUF(int N);
	~QuickFindUF();
	void unionPQ(int p, int q);
	int find(int p) const;
	bool connected(int p, int q) const;
	int remain() const;

};

#include "stdafx.h"
#include "QuickFindUF.h"


QuickFindUF::QuickFindUF(int N)
{
	arraySi