- 博客(43)
- 收藏
- 关注
RSS订阅原创 哈夫曼树的建立（二叉链表
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<sstream>#include<stack>#include<queue>#
2021-06-06 20:23:27
471
原创 线索二叉树
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<sstream>#include<stack>#include<queue>#
2021-05-31 20:09:49
64
原创 封锁阳光大学 连通图 每一条边有且仅有一个点被选中
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 0x3f3f3f3f#def
2021-05-16 14:10:27
77
原创 NOIP2017 奶酪 dfs
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 1000001#define
2021-05-11 16:25:25
81
原创 修复公路 并查集
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 1000001#define
2021-05-11 13:42:42
83
原创 普通平衡树
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 1000001#define
2021-05-07 19:52:12
54
原创 校门外的树
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-21 16:18:46
174
原创 线段树2
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-20 23:51:17
50
原创 线段树基本操作
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-20 19:45:17
65
原创 dp hdu1087起点最小终点最大
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-18 14:27:08
60
原创 dp hdu1158 三重for
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-17 20:21:21
62
原创 dp hdu6024涉及变动距离 二维dp数组
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-17 18:28:11
54
原创 dp hdu1398
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-16 20:08:16
77
原创 dp hdu1074位运算 栈 按字典序输出
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#include<stack>#define ll long long#def
2021-04-16 17:45:06
55
原创 dp hdu1260两个选择
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-16 15:50:08
53
原创 基础dp hdu1284钱币兑换问题
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-16 15:32:12
59
原创 dp最大数字段和 HDU1003
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-16 15:20:27
72
原创 DFS hdu5706字符二维数组
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-15 20:13:51
59
原创 HDU2579 BFS迷宫里的障碍会在K的整数倍时间时消失
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-15 18:25:56
80
原创 优先队列和BFS hdu1026 记录路径
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-14 23:15:33
68
原创 hdu1252
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-14 15:29:04
74
原创 essential
#includeusing namespace std;int a[45];int main(){int t,m,n,i;scanf("%d",&t);while(t–){scanf("%d%d",&n,&m);for(i=0;i<n;i++) scanf("%d",&a[i]);sort(a,a+n);
2021-04-14 14:49:27
59
原创 HDU1072bfs
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-14 14:35:54
55
原创 HDU2717(BFS)三种选择
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-13 20:45:23
87
原创 hdu1548 BFS队列
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-13 20:20:43
57
原创 HDU1455一道很好的dfs复杂情况收尾
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-13 18:59:44
100
原创 POJ3009dfs小球撞木块
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-13 15:39:48
78
原创 POJ1979dfs直接改原二维数组
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-13 14:29:08
65
原创 POJ2386水洼dfs
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-08 18:57:20
70
原创 输入输出
一些输入输出的注意string a；cin>>a; while(cin>>a&&a!="END"){b=""；b+=ch[i];gets(ch);string a,b; map<string,string> mp;//键值对mp cin>>a;//输入START while(cin>>a&&a!="END"){ cin>>b; mp[b]=a;//
2021-04-08 18:41:59
52
原创 HDU1462 二维数组Word Crosses
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-08 18:27:57
120
原创 hdu4414深度优先搜索
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-07 15:45:51
72
原创 hdu4717 The Moving Points三分
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-07 15:05:17
66
原创 HDU4004The Frog‘s Games青蛙过河 二分
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-06 20:57:27
91
原创 三分HDU3714
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-06 14:32:44
48
原创 A very hard mathematic problem二分HDU4282
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<queue>#define ll long long#define INF 0x7fffffff#de
2021-04-06 13:41:53
63
原创 Ants
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 1000005#define
2021-03-30 20:48:34
49
原创 Yogurt factory
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 1000001#define
2021-03-30 18:10:21
55
原创 #双栈初始化##判断栈空，栈满，进栈和出栈
#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 1000001#define INF 0x7fffffff#define M
2021-03-30 16:25:30
1041
原创 1063能量项链
#include<iostream>#include<algorithm>#include<cstdio>#include<string>#include<vector>#include<string.h>#include<map>#include<cmath>#include<set>#define ll long long#define maxn 1000001#define
2021-03-24 15:36:52
47
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人