最小数和最大数（数组实现）

状态	递交者	时间	内存	语言	代码	递交时间
AC	李某人	38ms	760 KiB		379 Bytes	2022-3-6 16:16:41
AC	人间理想小俗气	38ms	760 KiB		373 Bytes	2022-1-27 19:06:38
AC	ywh	38ms	788 KiB		347 Bytes	2022-2-19 11:05:10
AC	杜俊宏	38ms	760 KiB		278 Bytes	2022-4-11 19:19:39
AC	赵彬鸿	38ms	672 KiB		270 Bytes	2022-8-13 16:01:01
AC	程子杰 (05c41-czj)	39ms	1.4 MiB		348 Bytes	2022-7-27 11:01:57
AC	陈忝锐	39ms	812 KiB		359 Bytes	2022-2-12 17:11:01
AC	李某人	39ms	692 KiB		377 Bytes	2022-3-6 16:10:22
AC	lch (凌昌瀚)	39ms	720 KiB		296 Bytes	2022-7-8 22:17:28
AC	喵 (蹇心悦)	39ms	760 KiB		308 Bytes	2022-5-28 15:13:01
AC	贾鑫豪 (Mr Sam)	39ms	1.3 MiB		342 Bytes	2022-3-3 6:55:53
AC	李某人	39ms	760 KiB		379 Bytes	2022-3-6 16:16:45
AC	吴俊成 (wujuncheng)	39ms	1.4 MiB		467 Bytes	2022-7-11 11:23:35
AC	赵彬鸿	39ms	760 KiB		270 Bytes	2022-8-13 16:01:05
AC	你爹 (郭铠嘉)	39ms	904 KiB		333 Bytes	2022-2-10 19:55:36
AC	芒苒忧 (廖迦南)	39ms	392 KiB		227 Bytes	2022-8-15 14:29:41
AC	德克萨斯做的到吗 (liyangbao)	39ms	1.4 MiB		348 Bytes	2022-11-20 11:24:51
AC	郑之策	39ms	688 KiB		377 Bytes	2022-2-13 9:55:03
AC	陈杰晟	39ms	732 KiB		274 Bytes	2022-2-13 15:30:35
AC	时代二校+马嘉宸 (majiachen)	39ms	760 KiB		354 Bytes	2023-4-8 17:46:32
AC	赵彬鸿	39ms	780 KiB		270 Bytes	2022-8-13 16:01:01
AC	赵彬鸿	39ms	728 KiB		270 Bytes	2022-8-13 16:01:04
AC	CK (李弘毅)	39ms	6.9 MiB		289 Bytes	2023-11-4 12:15:07
AC	李某人	39ms	760 KiB		379 Bytes	2022-3-6 16:14:04
AC	李某人	39ms	760 KiB		377 Bytes	2022-3-6 16:11:10
AC	坤坤荔枝小黑子 (zhonghaotian22006)	39ms	868 KiB		349 Bytes	2022-6-5 18:22:31
AC	赵彬鸿	39ms	796 KiB		270 Bytes	2022-8-13 16:01:05
AC	陈骏逸 (chenjunyi)	39ms	740 KiB		326 Bytes	2022-10-6 22:02:09
AC	赵彬鸿	39ms	760 KiB		270 Bytes	2022-8-13 16:01:00
AC	朱老师 (zyp)	39ms	772 KiB		304 Bytes	2022-8-7 11:35:57
AC	王涵熙 (水煮大肠)	39ms	1.4 MiB		243 Bytes	2022-3-5 16:36:05
AC	李某人	39ms	720 KiB		379 Bytes	2022-3-6 16:14:05
AC	马渝杭 (mayuhang)	39ms	1.1 MiB		308 Bytes	2023-3-20 19:32:40
AC	李廷旭 (litingxu)	39ms	6.9 MiB		327 Bytes	2023-8-12 15:44:12
AC	赵彬鸿	39ms	684 KiB		270 Bytes	2022-8-13 16:01:02
AC	SYC0226	39ms	384 KiB		266 Bytes	2022-3-20 13:59:43
AC	赵彬鸿	39ms	716 KiB		270 Bytes	2022-8-13 16:01:04
AC	11451254188 (22029-mjh)	40ms	1.3 MiB		435 Bytes	2022-11-29 13:26:02
AC	疯神芭芭脱丝 (李卓修)	40ms	744 KiB		371 Bytes	2022-1-23 20:19:06
AC	LUKHE (LukeHu)	40ms	1.1 MiB		348 Bytes	2022-1-25 20:04:03
AC	徐正旺 (xzw)	40ms	1.3 MiB		274 Bytes	2022-7-31 21:49:23
AC	赵彬鸿	40ms	760 KiB		270 Bytes	2022-8-13 16:01:03
AC	赵彬鸿	40ms	760 KiB		270 Bytes	2022-8-13 16:01:02
AC	罗翌珂 (dangdang)	40ms	1.4 MiB		330 Bytes	2022-9-7 22:12:18
AC	郑岐蔚	40ms	2.9 MiB		282 Bytes	2023-1-26 14:38:27
AC	叶哲宇 (yzy)	40ms	6.8 MiB		269 Bytes	2023-6-23 10:45:39
AC	赵彬鸿	40ms	760 KiB		270 Bytes	2022-8-13 16:01:00
AC	赵彬鸿	40ms	688 KiB		270 Bytes	2022-8-13 16:01:00
AC	李某人	40ms	764 KiB		379 Bytes	2022-3-6 16:14:02
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	40ms	704 KiB		352 Bytes	2022-1-23 18:41:54
AC	luozixi	40ms	760 KiB		237 Bytes	2023-2-15 20:08:58
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)	41ms	1.3 MiB		414 Bytes	2022-11-27 10:30:41
AC	赵彬鸿	41ms	724 KiB		270 Bytes	2022-8-13 16:00:58
AC	傅博涛	41ms	760 KiB		297 Bytes	2022-1-22 11:17:35
AC	李某人	41ms	752 KiB		379 Bytes	2022-3-6 16:13:15
AC	luoluonuoya	41ms	432 KiB		360 Bytes	2022-1-26 16:41:30
AC	赵彬鸿	41ms	712 KiB		270 Bytes	2022-8-13 16:00:59
AC	赵彬鸿	41ms	760 KiB		270 Bytes	2022-8-13 16:01:00
AC	杨瀚霖 (yanghanlin)	41ms	1.1 MiB		351 Bytes	2023-2-11 11:31:49
AC	许炜铭 (xuweiming)	41ms	1.3 MiB		297 Bytes	2023-4-17 21:45:15
AC	ganlin1	42ms	6.9 MiB		229 Bytes	2023-7-29 10:43:03
AC	赵彬鸿	42ms	696 KiB		270 Bytes	2022-8-13 16:01:04
AC	李彭宋代诗人 (ljy123456)	42ms	1.1 MiB		307 Bytes	2023-4-12 21:38:36
AC	黄梓桐 (HuangZiTong)	42ms	1 MiB		245 Bytes	2022-8-13 21:24:37
AC	繁星 (05c35-zzm)	43ms	708 KiB		276 Bytes	2022-12-4 9:51:20
AC	陈红恺 (chk)	43ms	1.4 MiB		338 Bytes	2022-8-26 16:06:44
AC	张雯皓 (zhangwenhao)	44ms	7 MiB		316 Bytes	2023-12-23 11:23:07
AC	周琪渃	47ms	4.3 MiB		388 Bytes	2022-11-24 17:53:26
AC	时代二校+王吕棪 (wanglvyan)	49ms	404 KiB		209 Bytes	2023-4-8 17:49:57
AC	马渝杭 (mayuhang)	50ms	1.1 MiB		307 Bytes	2023-3-20 19:31:49
AC	yuhaodi	51ms	1.4 MiB		226 Bytes	2023-5-17 13:16:55
AC	wuzhenghan	52ms	760 KiB		210 Bytes	2023-2-9 19:03:45
AC	wangruibo20xh	53ms	760 KiB		160 Bytes	2022-1-20 21:19:08
AC	zyl	69ms	7.3 MiB		348 Bytes	2024-1-5 15:28:01
AC	贾博涵	71ms	7.2 MiB		265 Bytes	2023-12-1 11:25:21
AC	炸鱼4000+ (dxc)	72ms	7.2 MiB		241 Bytes	2023-11-29 21:55:21
AC	胡瀚文	79ms	1.1 MiB		192 Bytes	2022-7-18 11:56:04
AC	吃小孩的viv_	82ms	7.1 MiB		272 Bytes	2023-12-10 15:29:47
AC	fcxin	82ms	20.8 MiB	Python 3	88 Bytes	2024-8-14 11:27:55
AC	fjx	96ms	788 KiB		295 Bytes	2024-3-8 20:01:21
AC	zhangyouze (张佑泽)	100ms	1.3 MiB		344 Bytes	2024-2-26 15:50:51
AC	https://www.crazygames.com/game/merge-construct (陈诺)	100ms	916 KiB		293 Bytes	2024-2-4 22:42:21
AC	新壹街校区-冉睦阳（想要无敌天下吗，葵花宝典有售，不要18880，只要9999） (冉睦阳)	101ms	1.1 MiB		341 Bytes	2024-3-10 10:17:19
AC	拥抱幸福小熊(吴沛篪)	103ms	1.3 MiB		289 Bytes	2024-3-30 8:41:28
AC	jdy	103ms	1.3 MiB		301 Bytes	2024-3-12 20:12:58
AC	你个你怎么跟个一样 (钟卓劭)	103ms	1 MiB		222 Bytes	2024-3-17 14:10:39
AC	没有此人 (akm)	104ms	836 KiB	C++14	255 Bytes	2025-1-19 15:42:35
AC	uiuy (李潇睿666)	106ms	780 KiB	C++98(O2)	416 Bytes	2025-3-14 13:42:40
AC	weixingyu	108ms	1.3 MiB	C++11	346 Bytes	2025-1-12 11:29:42
AC	李晟熙	108ms	836 KiB	C++17	426 Bytes	2025-2-15 19:13:25
AC	罗康恒23025	111ms	868 KiB	C++11	310 Bytes	2025-3-2 15:36:32
AC	梨冻亿 (wiueh)	112ms	14.5 MiB	Python 3	100 Bytes	2022-1-23 18:16:05
AC	19598	116ms	20.2 MiB	Python 3	84 Bytes	2023-9-29 11:29:24
AC	谢润轩	118ms	14.5 MiB	Python 3	63 Bytes	2022-4-7 20:02:57
AC	高俊	120ms	20.1 MiB	Python 3	175 Bytes	2023-10-27 16:40:37
AC	可爱酱 (张可忻)	122ms	20.2 MiB	Python 3	183 Bytes	2023-10-11 15:28:37
AC	cola	123ms	15.2 MiB	Python 3	74 Bytes	2022-12-21 20:44:24
AC	kongql	129ms	11.9 MiB	Python 3	111 Bytes	2022-7-22 17:18:38
AC	谭红中 (不知道)	135ms	15.2 MiB	Python 3	89 Bytes	2023-1-15 14:21:40
AC	我推忘归人 (贺俊楠)	137ms	7.3 MiB		205 Bytes	2024-1-17 18:04:58