王小树的博客

问题 A: 通信系统#include<cstdio>#include<algorithm>const int maxn = 10010;int father[maxn];bool isRoot[maxn];void Init(int n) { for (int i = 1; i <= n; i++) { father[i] = i; isRoot[i] = false; }}int getfather(int x) { int a = x; w

《算法笔记》9.5小节——数据结构专题(2)->平衡二叉树（AVL）#include<cstdio>#include<math.h>#include<algorithm>using namespace std;struct node { int data,height; node* lchild; node* rchild;};node* newNode(int v) { node* Node = new node; Node->da

自己测试都是对的，提交答案错误，目前还未解决#include#include#include#includeusing namespace std;int cap3;map<int, bool> mp;int endnum;int src[6] = { 0,0,1,1,2,2 };int tar[6] = { 1,2,0,2,0,1 };struct node {int a;int b;int c;int step;};void pour(int target,