最小的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	soha (武夷岩)	15ms	384 KiB		219 Bytes	2022-9-13 19:26:30
AC	chenjunyao	15ms	6.7 MiB		240 Bytes	2023-9-2 23:26:23
AC	许峻浩	15ms	408 KiB		187 Bytes	2023-3-14 21:33:33
AC	霍弈丞小号	15ms	384 KiB		237 Bytes	2022-8-26 11:03:36
AC	郑尧 (zhengyao)	15ms	432 KiB		271 Bytes	2023-3-12 14:20:16
AC	廖永亨	15ms	492 KiB		233 Bytes	2022-12-7 18:03:07
AC	soha (武夷岩)	15ms	384 KiB		219 Bytes	2022-9-13 19:26:31
AC	王彬羽 (wby)	15ms	384 KiB		244 Bytes	2023-3-12 16:18:26
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	432 KiB		180 Bytes	2022-8-31 20:04:09
AC	scallway	15ms	512 KiB		183 Bytes	2022-9-13 19:23:56
AC	黄彦熹 (AK-203)	15ms	512 KiB		116 Bytes	2022-10-19 21:43:53
AC	黄盛凯	15ms	432 KiB		168 Bytes	2023-5-13 19:53:12
AC	叶哲宇 (yzy)	15ms	6.7 MiB		125 Bytes	2023-9-3 17:30:39
AC	xuniaoyin (徐袅音)	15ms	6.7 MiB		148 Bytes	2023-9-4 21:13:57
AC	许峻浩	15ms	384 KiB		187 Bytes	2023-3-14 21:36:38
AC	反恐子弹	15ms	392 KiB		142 Bytes	2022-9-9 19:22:48
AC	关博源	15ms	444 KiB		155 Bytes	2023-2-17 21:55:00
AC	许峻浩	15ms	392 KiB		187 Bytes	2023-3-14 21:33:30
AC	朱柯羽	15ms	384 KiB		188 Bytes	2022-9-10 17:55:20
AC	86想要钱 (twt)	15ms	512 KiB		213 Bytes	2022-9-7 19:13:28
AC	无尽的想象 (谭仕高)	15ms	512 KiB		203 Bytes	2023-3-10 14:27:48
AC	新壹街校区-吴鑫鹏 (吴鑫鹏)	15ms	384 KiB		239 Bytes	2022-9-9 19:55:32
AC	许峻浩	15ms	384 KiB		187 Bytes	2023-3-14 21:33:46
AC	hyh22031	15ms	520 KiB		243 Bytes	2023-3-16 21:51:36
AC	何昊宇 (22016-hhy)	16ms	6.9 MiB		148 Bytes	2023-8-13 10:25:08
AC	许峻浩	16ms	384 KiB		187 Bytes	2023-3-14 21:33:32
AC	李廷旭 (litingxu)	16ms	6.7 MiB		168 Bytes	2023-9-10 17:28:24
AC	zhangzhimo	16ms	392 KiB		196 Bytes	2022-9-7 19:23:42
AC	曹埊睿 (caodirui)	16ms	6.7 MiB		457 Bytes	2023-9-16 19:29:12
AC	金锦泽 (jinjinze)	16ms	512 KiB		149 Bytes	2023-3-8 19:17:57
AC	huanglu	16ms	384 KiB		214 Bytes	2022-9-9 19:29:28
AC	姚宏逸	16ms	392 KiB		217 Bytes	2022-10-18 17:06:13
AC	刘蕤篪 (lrc)	16ms	6.9 MiB		202 Bytes	2023-7-18 11:13:46
AC	爱琴海校区-黄辰浩 (huangchenhao)	16ms	512 KiB		169 Bytes	2023-3-13 20:18:56
AC	soha (武夷岩)	16ms	388 KiB		219 Bytes	2022-9-13 19:26:32
AC	李卓燃 (李卓燃1)	16ms	512 KiB		216 Bytes	2023-3-17 17:28:31
AC	黄梓桐 (HuangZiTong)	16ms	428 KiB		120 Bytes	2022-11-13 11:29:21
AC	1396013295	16ms	440 KiB		139 Bytes	2022-10-23 10:37:24
AC	许峻浩	16ms	432 KiB		187 Bytes	2023-3-14 21:37:07
AC	谭懿轩 (yanyixuan)	16ms	436 KiB		132 Bytes	2022-10-17 13:48:33
AC	杜俊宏	16ms	384 KiB		159 Bytes	2023-1-14 10:45:53
AC	许峻浩	16ms	512 KiB		187 Bytes	2023-3-14 21:33:26
AC	手搓STL stack 双向无环链表 _ 向量 2种实现方式: template <typename Map_Type> class Stack_l /* Stack _ List / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }Data; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }; public: unsigned int size(void) { return Data.List_Size; } Map_Type& top(void) { return Data.endp -> Node_Data; } void data(void) { return &Data; } bool empty(void) { return !((bool)Data.headp); } Stack_l<Map_Type>& push(Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type& push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type* push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(const Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = (Map_Type)push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& pop(void) { if (Data.headp) { if (Data.List_Size == 1u) { delete Data.headp; Data.List_Size = 0; Data.headp = 0; Data.endp = 0; } else { Data.endp = Data.endp -> lastp; delete Data.endp -> nextp; Data.endp -> nextp = 0; --Data.List_Size; } } return this; } Stack_l<Map_Type>& clear(void) { while (Data.List_Size) { pop(); } return this; } Stack_l<Map_Type>(void) { /* NULL / } Stack_l<Map_Type>(unsigned int data_size, Map_Type map_data) { Data.List_Size = data_size; while (data_size--) { Node nodep = new Node(); nodep -> Node_Data = map_data; if (Data.headp) { nodep -> lastp = Data.endp; Data.endp -> nextp = nodep; Data.endp = nodep; } else { Data.headp = nodep; Data.endp = nodep; } } } Stack_l<Map_Type>(Stack_l<Map_Type>& map_data) { if (!map_data.empty()) { List_Data listp = (List_Data)map_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; } } Stack_l<Map_Type>& operator=(Stack_l<Map_Type>& copy_data) { if (copy_data.empty()) return this; List_Data listp = (List_Data)copy_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; return this; } bool operator==(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() != Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return true; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return false; } return true; } bool operator!=(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() == Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return false; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return true; } return true; } ~Stack_l<Map_Type>(void) { clear(); } }; /* Stack _ List / template <typename Map_Type> class Stack_v / Stack _ Vector / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }Data; public: unsigned int size(void) { return Data.lastp - Data.headp; } Map_Type& top(void) { return (Data.lastp - 1); } void* data(void) { return &Data; } bool full(void) { if (!Data.headp) return true; return Data.endp + 1 == Data.lastp; } bool empty(void) { if (!Data.headp) return true; return Data.headp == Data.lastp; } Stack_v<Map_Type>& push(Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type& push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type* push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(const Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = (Map_Type)push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& pop(void) { if (empty()) { if (Data.lastp - Data.headp > 1) Data.resize((Data.lastp - Data.headp) >> 1); else return this; } else --Data.lastp; return this; } Stack_v<Map_Type>(void) { /* NULL / } Stack_v<Map_Type>(unsigned int data_size, Map_Type map_data) { while (data_size) { push(&map_data); --data_size; } } Stack_v<Map_Type>(Stack_v<Map_Type>& map_data) { Vector_Data datap = (Vector_Data)map_data.data(); for (unsigned int i = 0, k = map_data.size(); i != k; ++i) push(datap -> headp + i); } Stack_v<Map_Type>& operator=(Stack_v<Map_Type>& copy_data) { if (copy_data.empty()) clear(); else { Vector_Data datap = (Vector_Data)copy_data.data(); for (unsigned int i = 0, k = copy_data.size(); i != k; ++i) push(datap -> headp + i); } return this; } bool operator==(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return false; else if (empty() && cmp_data.empty()) return true; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap ->headp + i)) return false; } return true; } bool operator!=(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return true; else if (empty() && cmp_data.empty()) return false; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap -> headp + i)) return true; } return false; } Stack_v<Map_Type>& clear(void) { delete[] Data.headp; Data.headp = 0; Data.lastp = 0; Data.endp = 0; return this; } ~Stack_v<Map_Type>(void) { delete[] Data.headp; } }; / Stack _ Vector */ int main(void) { return 0; } (22029-xys)	16ms	6.8 MiB		147 Bytes	2023-6-11 10:33:32
AC	何洋名 (heyangming)	16ms	6.9 MiB		155 Bytes	2023-7-3 19:13:34
AC	许峻浩	17ms	384 KiB		187 Bytes	2023-3-14 21:36:59
AC	Randy Marsh (杨子腾)	17ms	436 KiB		132 Bytes	2023-1-11 13:52:10
AC	我是曾科智儿子 (沈小童)	17ms	392 KiB		332 Bytes	2023-3-12 9:27:13
AC	缥 (王硕2012)	17ms	512 KiB		275 Bytes	2022-11-22 12:01:12
AC	坤坤荔枝小黑子 (zhonghaotian22006)	17ms	432 KiB		238 Bytes	2022-10-12 18:24:08
AC	王晨志 (wangchenzhi)	19ms	512 KiB		334 Bytes	2022-10-8 17:14:56
AC	huyinuo	19ms	512 KiB		132 Bytes	2022-10-10 11:04:31
AC	许峻浩	20ms	444 KiB		187 Bytes	2023-3-14 21:36:45
AC	11111	21ms	432 KiB		125 Bytes	2022-10-27 17:02:25
AC	许峻浩	22ms	512 KiB		187 Bytes	2023-3-14 21:37:18
AC	( ) (李恺伦)	60ms	544 KiB		171 Bytes	2024-3-10 18:24:42
AC	陈诺	62ms	532 KiB		203 Bytes	2024-2-5 12:21:36
AC	Guest	66ms	764 KiB	C++17	132 Bytes	2024-10-5 16:10:46
AC	鸠 (jianxinming)	67ms	576 KiB	C++20(O2)	132 Bytes	2024-9-10 10:33:48
AC	王祎辰 (wangyichen)	68ms	788 KiB		157 Bytes	2024-3-21 21:26:11
AC	陈牧远	68ms	764 KiB		288 Bytes	2024-3-23 19:03:24
AC	zyl	69ms	548 KiB		436 Bytes	2024-1-25 14:54:20
AC	煞笔笔	69ms	764 KiB		192 Bytes	2024-2-23 20:57:17
AC	陈牧远	71ms	764 KiB		288 Bytes	2024-3-23 19:03:18
AC	张瑞博	72ms	532 KiB	C++11	182 Bytes	2024-9-17 11:42:34
AC	新壹街校区-冉睦阳 (冉睦阳)	72ms	764 KiB	C++98	187 Bytes	2024-9-12 15:58:22
AC	我推的乱破 (贺俊楠)	217ms	4 MiB	Python 3	84 Bytes	2023-1-4 11:31:20
AC	11451254188 (22029-mjh)	218ms	4.1 MiB	Python 3	49 Bytes	2022-11-20 18:56:16
AC	this far (叶睿)	529ms	3.8 MiB	Python 3	40 Bytes	2024-4-2 19:11:52