小鱼酱の前端之路( •̀ ω •́ )y

算法介绍：【每日算法】堆排序&优先队列代码实现：#include #include #include #define MAX 123456using namespace std;class PriorityQueue{private: int A[1123]; /// 堆化数组 int heapSize;public: /// 初始

#include <iostream>#include <cstring>using namespace std;int map[1123][1123]; /// 储存图int vis[1123]; /// 标记该点是否已被访问int ans[1123]; /// 储存遍历序列int p;void dfs(int k, int n){ vis[k] = 1; ans[p++

#include <iostream>#include <cmath>#include <cstdlib>#include <queue>#include <cstring>using namespace std;int map[1123][1123]; ///储存邻接表int vis[1123]; /// 标记节点是否已访问int ans[1123]; /// 储存遍历序列int p

#include <bits/stdc++.h>using namespace std;typedef char ElemType;class Stack{private: ElemType *up; ElemType *base; ElemType length;public: Stack(){ base = new ElemType;

#include <bits/stdc++.h>#define MAX 1000000using namespace std;int next[MAX];char s[MAX];char p[MAX];void GetNext(); /// 获取next数组void Kmp();int main(){ int n,m; cin >> n; for(int i = 0;

#include <bits/stdc++.h>using namespace std;int main(){ int n,t; while(cin >> n >> t) { stack<long long>S; queue<long long>Q; char st[10]; int flag = 1;

#include <bits/stdc++.h>using namespace std;int r[1123][1123];int f[1123][1123];int m,n;int sum;void bfs(int x, int y){ if(x == n && y == m) { sum++; return ; } f[x

#include <bits/stdc++.h>using namespace std;typedef int ElemType;int m;class Stack{private: ElemType *up; ElemType *base; ElemType length;public: Stack(){ base = new ElemType

#include <bits/stdc++.h>using namespace std;typedef int ElemType;class Stack{private: ElemType *up; ElemType *base; ElemType length;public: Stack(){ base = new ElemType;

#include <bits/stdc++.h>using namespace std;typedef int ElemType;struct Node{ ElemType data; ElemType num; ElemType next;}p[100100];int main(){ int T; struct Node t; cin >>

#include <iostream>#include <cstring>using namespace std;int map[1123][1123];int vis[1123];int p;void dfs(int k, int n){ vis[k] = 1; for(int i = 0; i < n; i++) { if(!vis[i] && m

#include <iostream>#include <cstring>#include <cstdlib>using namespace std;int map[1123][1123];int vis[1123];int ans[1123];int p;void dfs(int k, int n){ vis[k] = 1; ans[p++] = k; for

#include <iostream>#include <cstdlib>#include <cstring>#include <queue>using namespace std;int map[1123][1123];int vis[1123];struct node{ int x; /// 记录当前点 int step; /// 记录此时已走了多少步};void

#include <iostream>#include <string>#define ElemType intusing namespace std;int flag;typedef struct BinSortTree{ struct BinSortTree *left; struct BinSortTree *right; ElemType data;}Node

#include <bits/stdc++.h>using namespace std;int res[101000]; /// 数组开大int n;/*** 递归实现*/int QuickSort(int key, int left, int right){ if(left > right) { return -1; } int mid

#include <bits/stdc++.h>using namespace std;int a[1001000];int main(){ ios::sync_with_stdio(false); int n; while(cin >> n) { memset(a, 0, sizeof(a)); for(int i = 0; i <

#include <bits/stdc++.h>using namespace std;int arr[1001000];int main(){ ios::sync_with_stdio(false); int n, k; while(cin >> n >> k) { int t = -1; for(int i = 0; i < n

#include <iostream>#include <cstring>using namespace std;int map[1123][1123];int in[1123]; /// 记录入度void Topo(int n){ int flag; for(int i = 1; i <= n; i++) { flag = 0; for

#include <iostream>#include <cstdio>#include <cstring>#define MAX 0x3f3f3f3fusing namespace std;int map[1123][1123];int vis[1123];int lowcost[1123];int flag, sum;void prim_MST(int n){ flag =

#include <iostream>#include <cstring>#define MAX 0x3f3f3f3fusing namespace std;int map[1123][1123];int vis[1123], b[1123];int flag;bool judge(int n){ for(int i = 1; i <= n; i++) {

#include <iostream>#include <cstring>#define MAX 0x3f3f3f3fusing namespace std;struct node{ int l, w;}map[1123][1123];void Floyd(int n, int s, int d){ for(int i = 0; i < n; i++) {

#include <iostream>#include <cstdio>#include <cstring>#define MAX 0x3f3f3f3fusing namespace std;int map[1123][1123];int vis[1123];int lowcost[1123];int flag, sum;void prim_MST(int n){ flag =

#include <bits/stdc++.h>using namespace std;typedef int ElemType;struct Node{ ElemType data; ElemType num; ElemType next;}p[100100];int main(){ int T; struct Node t; cin >>

#include <bits/stdc++.h>#define MAX 1000000using namespace std;char st[100];bool match(char a, char b){ if( (a == '(' && b == ')') || (a == '{' && b == '}') || (a == '[' && b == '

#include <bits/stdc++.h>using namespace std;typedef int ElemType;class Stack{private: ElemType *up; ElemType *base; ElemType length;public: Stack(); void push(ElemType); void

#include<bits/stdc++.h>using namespace std;int main(){ int ans[102000]; /// 下次数组要开大！！！ int uset[102000]; /// N+1次RE 是不是没有脑子！！！ int t,n,m; cin >> t; while(t--) { cin >>

#include <bits/stdc++.h>using namespace std;typedef struct BinaryTree{ char data[23]; int cnt; /// 记录此时该类树的个数 struct BinaryTree *Left; struct BinaryTree *Right;}Node;int n;void BiTre

#include <bits/stdc++.h>#define ElemType intusing namespace std;typedef struct AVLTree{ ElemType data; ElemType bal; /// 记录平衡因子 struct AVLTree *Left; struct AVLTree *Right;}Node;int

#include <bits/stdc++.h>#define ElemType charusing namespace std;ElemType arr[1123];ElemType res[1123];typedef struct BinaryTree{ ElemType data; struct BinaryTree *Left; struct BinaryTr

#include<bits/stdc++.h>using namespace std;int main(){ int la; /// ASCII编码长度 : 表示占多少位长 即 一个ASCII长度为一字节，8位 int lh; /// Huffman编码长度 int num[1123]; string st; while(cin >> st) {

#include <bits/stdc++.h>#define ElemType charusing namespace std;int i;ElemType st[1123];typedef struct BinaryTreeNode{ ElemType data; struct BinaryTreeNode *Left; struct BinaryTreeNode

#include <bits/stdc++.h>#define ElemType charusing namespace std;ElemType arr[1123];ElemType res[1123];typedef struct BinaryTree{ ElemType data; struct BinaryTree *Left; struct BinaryTr

#include<bits/stdc++.h>using namespace std;int main(){ int n; while(cin >> n) { priority_queue<int, vector<int>, greater<int> > Q; long long x; for(int i = 0; i < n

#include <bits/stdc++.h>using namespace std;int uset[1123];void MakeSet(int n); /// 初始化并查集int FindBoss(int x); /// 找爹 23333void Merge(int a, int b); /// 合并int main(){ int n,m; while(cin >>

#include <bits/stdc++.h>using namespace std;int Hash[100100];/*全局变量 静态变量初始值为0局部变量 自动变量初始值随机分配*/int main(){ ios::sync_with_stdio(false); int n,m; int key; cin >> n >> m; for(in

#include <bits/stdc++.h>using namespace std;int main(){ int Hash[1123]; int Seat[1123]; int n,p; while(cin >> n >> p) { int k = 0; memset(Hash,-1,sizeof(Hash));

#include <bits/stdc++.h>using namespace std;int main(){ int Hash[1123]; int Seat[1123]; int n,p; while(cin >> n >> p) { int k = 0; memset(Hash,-1,sizeof(Hash));

#include <bits/stdc++.h>using namespace std;typedef int ElemType;ElemType level[1123];char st[1123];char res[1123];class Stack{private: ElemType *up; /// 指向栈顶 ElemType *base; /// 指向栈底 E

#include <bits/stdc++.h>using namespace std;typedef int ElemType;class Stack{private: ElemType *up; /// 指向栈顶 ElemType *base; /// 指向栈底 ElemType length; /// sizepublic: Stack(); /// 初始

3-7 类的友元函数的应用#include <bits/stdc++.h>using namespace std;class Point{private: double x, y;public: Point(double x = 0, double y = 0); void Output(const char *name); friend void Distanc