基础
When_3*four
这个作者很懒,什么都没留下…
展开
-
哈夫曼树的建立(二叉链表
#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 · 515 阅读 · 0 评论 -
线索二叉树
#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 · 73 阅读 · 0 评论 -
封锁阳光大学 连通图 每一条边有且仅有一个点被选中
#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 · 85 阅读 · 0 评论 -
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 · 91 阅读 · 0 评论 -
修复公路 并查集
#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 · 96 阅读 · 0 评论 -
普通平衡树
#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 · 67 阅读 · 0 评论 -
线段树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 · 64 阅读 · 0 评论 -
线段树基本操作
#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 · 76 阅读 · 0 评论 -
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 · 72 阅读 · 0 评论 -
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 · 73 阅读 · 0 评论 -
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 · 108 阅读 · 0 评论 -
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 · 101 阅读 · 0 评论 -
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 · 74 阅读 · 0 评论 -
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 · 80 阅读 · 0 评论 -
输入输出
一些输入输出的注意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 · 62 阅读 · 0 评论 -
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 · 129 阅读 · 0 评论 -
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 · 81 阅读 · 0 评论 -
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 · 84 阅读 · 0 评论 -
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 · 110 阅读 · 0 评论 -
三分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 · 66 阅读 · 0 评论 -
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 · 80 阅读 · 0 评论 -
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 · 62 阅读 · 0 评论 -
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 · 73 阅读 · 0 评论 -
#双栈初始化##判断栈空,栈满,进栈和出栈
#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 · 1104 阅读 · 0 评论 -
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 · 60 阅读 · 0 评论 -
Best Cow Line
#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-22 20:43:53 · 69 阅读 · 0 评论 -
顺序表ADT模板简单应用算法设计:线性表的合并
#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-20 17:52:34 · 244 阅读 · 0 评论 -
顺序表ADT模板简单应用算法设计:删除顺序表中的冗余元素
#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-20 17:20:23 · 269 阅读 · 0 评论