摘要:
要求O(1) 查找元素的存在 struct HashMap{ static const int Hash=999917,maxn=46340; int num,link[Hash],son[maxn+5],next[maxn+5],w[maxn+5]; int top,Stack[maxn+5]; 阅读全文
posted @ 2023-05-02 16:40
towboat
阅读(8)
评论(0)
推荐(0)
摘要:
#include<iostream> #include<cstdio> #include<string> #include<cstring> #include<cmath> #include<algorithm> #include<stack> #include<queue> #include<ve 阅读全文
posted @ 2023-05-02 13:22
towboat
阅读(8)
评论(0)
推荐(0)
摘要:
https://blog.csdn.net/u011815404/article/details/88381586 #include<iostream> #include<vector> #include <cstring> #include<string> using namespace std; 阅读全文
posted @ 2023-05-02 12:24
towboat
阅读(11)
评论(0)
推荐(0)
摘要:
百度百科> #include<iostream> #include<vector> #include<string> using namespace std; struct wint:vector<int> { wint(int n=0) { push_back(n); check(); } win 阅读全文
posted @ 2023-05-02 11:36
towboat
阅读(16)
评论(0)
推荐(0)
摘要:
https://baijiahao.baidu.com/s?id=1614495972671761444&wfr=spider&for=pc 阅读全文
posted @ 2023-05-02 00:09
towboat
阅读(19)
评论(0)
推荐(0)