2020年07月__Hsiung

原创 A1018 Public Bike Management [dj]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>#include<map>#include<cstring>#include<set>using namespace std;const .

2020-07-31 20:17:44 78

原创 A1030 Travel Plan [dj]

dj算法：直接找最短路径#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>#include<map>#include<cstring>#include<set>using namespa.

2020-07-30 23:54:54 119

原创 A1013 Battle Over Cities [图的dfs遍历]

用图的dfs遍历来算删除结点后连通块的个数，连通块的个数减1就是需要添加的线的个数#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>#include<map>#include<cstring>using.

2020-07-29 16:10:39 92

原创 A1076 Forwards on Weibo [图的遍历bfs]

题目大意：给出查询，求微博的可能的最大转发数量。给出k个人和他关注的人，然后给查询人。用邻接表实现#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>#include<map>#include<cstring&g.

2020-07-29 12:52:28 98

原创 A1034 Head of a Gang [图的dfs遍历]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>#include<map>using namespace std;int weight[2001], G[2001][2001];bool visit[2001];.

2020-07-29 08:34:43 80

原创 A1098 Insertion or Heap Sort [堆排序]

堆排序，先不断向下调整建最大堆，然后堆排序#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;bool judge(int a[], int b[], int n){ for (int.

2020-07-28 13:32:06 83

原创 hdu 畅通工程 +05-树8 File Transfer [并查集]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 1001;int father[maxn];int findfather(int x){ in.

2020-07-27 17:02:14 85

原创 hdu 畅通工程 [并查集]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<strin...

2020-07-27 17:02:00 18

原创 A1107 Social Clusters [并查集]

题解：每个人选的有一门课程编号相同，那么他们属于同一个圈子，从大到小输出圈子的人数。做法：就是看总共有几个根节点，且根节点里面子节点个数多少。并查集的考察，先把第一个人选的三门课的父节点都设置为第一个人的编号1。然后后面的人若有不同的则设置成自己的编号，有一门相同就并到前面的人中去。从前到后扫得父节点是x的人数++ 最后输出。#include<iostream>#include<vector>#include<queue>#include<stack&.

2020-07-27 16:03:51 97

原创 A1123 Is It a Complete AVL Tree [avl]

考察知识：avl树建树，判断一棵树是否是完全二叉树，层序遍历输出白痴bug卡了40分钟！！！！！#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 100.

2020-07-27 10:00:16 70

原创 A1066 Root of AVL Tree [avl 插入/模板题]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 1001;struct node{ int v, height; node* left, * ri.

2020-07-26 17:38:06 87

原创 A1115 Counting Nodes in a BST [bst/dfs]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 1001;struct node{ int data; node* left,* right;}.

2020-07-26 11:22:45 61

原创 A1099 Build A Binary Search Tree [bst]

还是中序遍历建树，只不过这次利用二叉树静态写法，因为给出结点编号的关系。#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 101;struct node.

2020-07-26 10:36:29 90

原创 A1064 Complete Binary Search Tree [下标建树/bst]

因为每个结点左子节点下标2i 右2i+1 然后开一个数组，因为是完全二叉搜索树，可以用数组来存值，讲赋值的数组从小到大排序然后直接中序遍历赋值，因为中序遍历是左根右，从小到大的顺序。//先建树，然后镜像树先序就是先遍历右边的后序也先遍历右边的#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.

2020-07-26 09:27:40 78

原创 A1043 Is It a Binary Search Tree [bst]

题目思路：先建树，先序遍历一遍和输入的比较判断是yes还是no，然后注意镜像树先序就是先遍历右边的后序也先遍历右边的#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;struct no.

2020-07-25 17:41:22 75

原创 A1106 Lowest Price in Supply Chain [dfs]

输出最小价格和能提供最低价格的叶子结点的个数#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 111110;vector<int>node[.

2020-07-24 17:40:17 52

原创 A1004 Counting Leaves [dfs]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 110;vector<int>node[maxn];int hashtable[maxn].

2020-07-24 16:56:32 63

原创 A1094 The Largest Generation [dfs/bfs]

这里是按层求最大节点个数及所在的层数，所以要每条路走一遍记录一下。#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 110;vector<int&.

2020-07-24 15:57:34 72

原创 A1079 Total Sales of Supply Chain [dfs]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<math.h>#include<algorithm>using namespace std;const int maxn = 100001;struct node{ double data; vector<int&gt.

2020-07-24 11:22:33 64

原创 A1090 Highest Price in Supply Chain [dfs]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<algorithm>#include<math.h>using namespace std;const int maxn = 100001;vector<int>child[maxn];int n, maxDepth.

2020-07-24 10:31:34 56

原创 A1053 Path of Equal Weight [dfs]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>#include<algorithm>using namespace std;const int maxn = 110;struct node{ int weight; vector<int>child;}Node[maxn];bool c.

2020-07-24 08:40:18 65

原创 A1119 Pre- and Post-order Traversals [前序后序转中序]

前序和后序之所以不确定一棵树的原因就是当只有一棵子树的时候，不确定是左子树还是右子树。找前序的第二个结点在后续中位置，左边就是左子树。递归建树#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>using namespace std;const int maxn = 50;struct node{ int data; .

2020-07-23 18:29:38 100

原创 A1110 Complete Binary Tree [完全二叉树判定]

思路：利用层序遍历判断是否是一棵完全二叉树，给的下标同样利用二叉树的静态写法#include<iostream>#include<vector>#include<queue>#include<stack>#include<string>using namespace std;const int maxn = 21;int n, last;struct node{ int lchild, rchild;}Node[maxn].

2020-07-23 16:07:23 123

原创 A1102 Invert a Binary Tree [反转二叉树/镜像]

给一棵二叉树子节点下标，要求反转二叉树，之后按要求输出层序和中序遍历。思路：因为是给的子节点下标，用二叉树的静态写法会更加方便，找出根节点后，按照后序遍历反转二叉树（交换左右子树），然后再按照模板层序中序遍历输出#include<iostream>#include<vector>#include<queue>#include<stack>using namespace std;const int maxn = 110;struct node.

2020-07-23 11:18:05 88

原创 A1086 Tree Traversals Again [前序中序建树]

#include<iostream>#include<vector>#include<queue>#include<stack>#include<cstring>using namespace std;const int maxn = 31;struct node{ int data; node* left; node* right;};int pre[maxn], in[maxn], post[maxn];int n.

2020-07-23 09:57:59 61

原创 A1020 Tree Traversals [中序后序建树]

题目大意：给你中序后序，要求输出层序。#include<iostream>#include<vector>#include<queue>using namespace std;const int maxn = 50;struct node{ int data; node* left, * right;};int pre[maxn], in[maxn], post[maxn];int n;node* create(int postl, int p.

2020-07-23 08:59:17 81

原创 bfs 找步数最少的迷宫路径

11步#include<iostream>#include<queue>using namespace std;const int maxn = 100;struct node{ int x, y; int step;}S,T,Node;int n, m;char map[maxn][maxn];bool inqueue[maxn][maxn] = { false };int x[4] = { 0,0,1,-1 };int y[4] = { 1,-1,0,

2020-07-22 17:05:45 123

原创 hdu 1241

#include <iostream>using namespace std;char a[105][105], v[105][105];int n, m;void dfs(int x, int y){ if (x < 0 || y < 0 || x >= n || y >= m)return; if (a[x][y] == '*' || v[x][y])return; v[x][y] = 1; dfs(x - 1, y - 1); dfs(x - .

2020-07-22 11:08:56 105

原创 hdu 素数环

全排列dfs的拓展#include<iostream>#include<algorithm>#include<math.h>using namespace std;int n, val[1010], hasht[1010];bool isprime(int n){ if (n <= 1) return false; int sqr = sqrt(n); for (int i = 2; i <= sqr; i++) { if (n %.

2020-07-22 10:00:05 122

原创 A1054 The Dominant Color [map]

#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cstring>#include<string>using namespace std;int main(){ int n, m, col; cin >> .

2020-07-21 23:26:37 93

原创 A1097 Deduplication on a Linked List [链表去重]

#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cstring>#include<string>#include<queue>#include<array>#include<stack&gt.

2020-07-21 16:59:39 68

原创 A1074 Reversing Linked List [链表高级倒置]

分块先分块输出再讨论输出每块最后一个点，看这个点是否在最后一块内。#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cstring>#include<string>#include<queue>#include.

2020-07-21 16:12:23 121

原创 A1052 Linked List Sorting [链表排序]

#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cstring>#include<string>#include<queue>#include<array>#include<stack&gt.

2020-07-21 11:06:58 60

原创 A1032 Sharing [链表]

#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cstring>#include<string>#include<queue>#include<array>#include<stack&gt.

2020-07-21 09:27:25 63

原创 A1051 Pop Sequence [栈的应用]

#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cstring>#include<string>#include<queue>#include<array>#include<stack&gt.

2020-07-20 15:13:25 88

原创 A1022 Digital Library [map]

思路：根据书本信息查出所有的与之相关的书本编号，用map<string,set> 存开五个容器存不同信息根据不同的查询种类利用关键字查询。注意事项：参数传引用比传值更快#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cst.

2020-07-19 16:17:00 78

原创 A1071 Speech Patterns [map]

题意：统计由数字和字母组成的“个数”，找出出现频率最高的那个。思路：对一个单词一个单词的扫描进map记数#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>#include<cstring>#include<string>using name.

2020-07-19 15:03:33 68

原创 A1100 Mars Numbers [map映射]

貌似cin完之后；读入的光标实际上是停在cin读入的c的后面；这时如果是用cin.get或cin.getline或getchar之类的东西再读入，就会吃进c后面的回车；而如果用cin读入，因为cin本身是会略过回车读入的，所以对cin不会有影响#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include.

2020-07-19 10:44:53 76

原创 A1060 Are They Equal [string]

题目大意：判断两个数字的科学计数法是否相等思路：有两种类型一是0.XXXX而是XXXX.XXXX 分别去0去小数点。判断主体和指数是否相等。#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>using namespace std;const int N=5.

2020-07-19 09:03:01 88

原创 A1063 Set Similarity [set]

#include<vector>#include<iostream>#include<algorithm>#include<unordered_map>#include<set>#include<map>using namespace std;const int N=51;set<int>st[N];void compare(int a, int b){ int differentnum=st[b]..

2020-07-18 10:36:21 81

空空如也

空空如也